Edge-fault diameter of \(C_4\)-free graphs

DOI10.1016/j.disc.2023.113678zbMath1525.05032OpenAlexW4386456092MaRDI QIDQ6080136

Peter Dankelmann, Unnamed Author

Publication date: 30 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2023.113678

zbMATH Keywords

diameterfault diameterdiameter vulnerabilityedge-fault diameterfault tolerant diameter

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
• Fault diameter of Cartesian product graphs
• Edge, vertex and mixed fault diameters
• Fault-diameter of Cartesian graph bundles
• Fault diameter of product graphs
• Some topological properties of folded Petersen graph
• Fault diameter of interconnection networks
• On the fault-diameter of the star graph
• Radius, diameter, and minimum degree
• Disjoint paths of bounded length in large generalized cycles
• Generalized diameters of the mesh of trees
• On the diameter vulnerability of Kautz digraphs
• Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks
• Diameter, edge-connectivity, and \(C_4\)-freeness
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• Diameter increase caused by edge deletion
• Fault tolerance properties of pyramid networks
• On the fault-tolerant diameter and wide diameter of ?-connected graphs
• Diameter bounds for altered graphs
• On Graphs that do not Contain a Thomsen Graph

This page was built for publication: Edge-fault diameter of \(C_4\)-free graphs