On the connectivity and superconnected graphs with small diameter

DOI10.1016/j.dam.2009.10.002zbMath1225.05153OpenAlexW2091627032MaRDI QIDQ968157

Camino Balbuena, Luis Pedro Montejano, Kim Marshall

Publication date: 5 May 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2009.10.002

zbMATH Keywords

diameterconnectivitygirthsuperconnected

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Related Items

LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS ⋮ Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions ⋮ Superconnectivity of graphs with odd girth \(g\) and even girth \(h\) ⋮ Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors ⋮ On the connectivity and restricted edge-connectivity of 3-arc graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the restricted connectivity and superconnectivity in graphs with given girth
• Lower connectivities of regular graphs with small diameter
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Superconnectivity of regular graphs with small diameter
• Sufficient conditions for maximally connected dense graphs
• On the order and size of \(s\)-geodetic digraphs with given connectivity
• Connectivity of Regular Directed Graphs with Small Diameters
• Circulants and their connectivities
• Synthesis of reliable networks - a survey
• Minimum order graphs with specified diameter, connectivity, and regularity
• Maximally connected digraphs