k-fault-tolerant graphs for p disjoint complete graphs of order c

DOI10.7151/DMGT.2504MaRDI QIDQ6985872zbMATH OpenFDO

Authors Sylwia Cichacz-Przenioslo, Agnieszka Görlich, Karol Suchan

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2504

zbMATH Keywords

\(k\)-critical graphalgorithmfactorfault-toleranceinterconnection network

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• (H,k) stable graphs with minimum size
• A generalization of an independent set with application to (K_q; k)-stable graphs
• A Graph Model for Fault-Tolerant Computing Systems
• Designing fault-tolerant systems using automorphisms
• Explicit construction of linear sized tolerant networks
• Graph Classes: A Survey
• Graph theory
• scientific article; zbMATH DE number 1256708 (Why is no real title available?)
• scientific article; zbMATH DE number 238423 (Why is no real title available?)
• Largest component and node fault tolerance for grids
• Minimum \(k\)-critical bipartite graphs
• Minimum size of n-factor-critical graphs and k-extendable graphs
• Minimum vertex blocker clique problem
• On (K_q;k)-stable graphs
• On k-factor-critical graphs
• On Fault-Tolerant Low-Diameter Clusters in Graphs
• On Minimum Fault-Tolerant Networks
• On the structure of factorizable graphs

Cited in

(1)

• Minimum k-critical-bipartite graphs: the irregular case

This page was built for publication: \(k\)-fault-tolerant graphs for \(p\) disjoint complete graphs of order \(c\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985872)