Imagen de Portada

The $g$-good-neighbor diagnosability of product networks under the PMC model

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wang, Zhao, Mao, Yaping, Hsieh, Sun-Yuan, Klasing, Ralf
Formato:	Preprint
Publicado:	2025
Materias:	Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Monitoring the edges of product networks using distances
por: Li, Wen, et al.
Publicado: (2022)

Perturbation results for distance-edge-monitoring numbers
por: Yang, Chenxu, et al.
Publicado: (2023)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
por: Chakraborty, Dibyayan, et al.
Publicado: (2024)

On locating and neighbor-locating colorings of sparse graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2023)

Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
por: Chen, Yeyuan
Publicado: (2024)

On $(k,g)$-Graphs without $(g+1)$-Cycles
por: Eze, Leonard Chidiebere, et al.
Publicado: (2024)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
por: Beaudou, Laurent, et al.
Publicado: (2021)

Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
por: Eze, L. C., et al.
Publicado: (2025)

Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs
por: Yu, Shanshan, et al.
Publicado: (2026)

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
por: Hoppenot, Pierre, et al.
Publicado: (2024)

Asynchronous dynamics of isomorphic Boolean networks
por: Bridoux, Florian, et al.
Publicado: (2024)

Strong modules and asynchronous attractors of Boolean networks
por: Ruet, Paul
Publicado: (2026)

Stability for binary scalar products
por: Kupavskii, Andrey, et al.
Publicado: (2024)

On core of categorical product of (di)graphs
por: Naserasr, Reza, et al.
Publicado: (2025)

Matroid products via submodular coupling
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Reachability in temporal graphs under perturbation
por: Enright, Jessica, et al.
Publicado: (2024)

Interaction graphs of isomorphic automata networks II: universal dynamics
por: Bridoux, Florian, et al.
Publicado: (2024)

Minimum length word-representants of graph products
por: Srinivasan, Eshwar, et al.
Publicado: (2024)

Three-dimensional graph products with unbounded stack-number
por: Eppstein, David, et al.
Publicado: (2022)

Directed treewidth is closed under taking butterfly minors
por: Kim, Gunwoo, et al.
Publicado: (2025)

Approximating temporal modularity on graphs of small underlying treewidth
por: Agdur, Vilhelm, et al.
Publicado: (2025)

Interaction between skew-representability, tensor products, extension properties, and rank inequalities
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Trees with maximum $σ$-irregularity under a prescribed maximum degree 6
por: Bašić, Milan
Publicado: (2026)

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs
por: Garzón, E. M., et al.
Publicado: (2024)

On expectations and variances in the hard-core model on bounded degree graphs
por: Davies, Ewan, et al.
Publicado: (2025)

A lower bound on the spectrum of unimodular networks
por: Rahman, Mustazee
Publicado: (2016)

A concentration phenomenon for $h$-extra edge-connectivity reliability analysis of enhanced hypercubes $Q_{n,2}$ with exponentially many faulty links
por: Sun, Yali, et al.
Publicado: (2024)

Boolean Functions with Small Approximate Spectral Norm
por: Cheung, Tsun-Ming, et al.
Publicado: (2024)

Proper conflict-free choosability of planar graphs
por: Wang, Yuting, et al.
Publicado: (2025)

Balanced colorings of Erdős-Rényi hypergraphs
por: Dhawan, Abhishek, et al.
Publicado: (2025)

Spectral Sufficient Conditions for Graph Factors
por: Ren, Fengyun, et al.
Publicado: (2025)

Throttling for metric dimension and its variants
por: Brimkov, Boris, et al.
Publicado: (2025)

Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
por: Duvignau, Romaric, et al.
Publicado: (2024)

Evaluating the Gilbert-Varshamov Bound for Constrained Systems
por: Goyal, Keshav, et al.
Publicado: (2024)

Boundedness and Separation in the Graph Covering Number Framework
por: Goetze, Miriam, et al.
Publicado: (2025)

On graphs with a simple structure of maximal cliques
por: Gollin, J. Pascal, et al.
Publicado: (2025)

Determining a graph from its reconfiguration graph
por: Berthe, Gaétan, et al.
Publicado: (2025)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
por: Bourneuf, Romain, et al.
Publicado: (2025)

Induced Minors and Region Intersection Graphs
por: Bonnet, Édouard, et al.
Publicado: (2025)

Self-Orthogonal Cellular Automata
por: Mariot, Luca, et al.
Publicado: (2025)