Largest component and node fault tolerance for grids

DOI10.37236/8376zbMath1459.05214OpenAlexW3136852174MaRDI QIDQ2656897

Andrzej Żak, Jakub Przybyło

Publication date: 17 March 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/8376

zbMATH Keywords

\(t\)-node fault tolerant graphlargest component of a graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

A note on the integrity of grids

Cites Work

• Unnamed Item
• Unnamed Item
• Explicit construction of linear sized tolerant networks
• A survey of integrity
• On sparse graphs with dense long paths
• Two results about the hypercube
• The integrity of a cubic graph
• (H,k) stable graphs with minimum size
• A Graph Model for Fault-Tolerant Computing Systems
• On Minimum Fault-Tolerant Networks
• Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs

This page was built for publication: Largest component and node fault tolerance for grids