On the connectivity and superconnected graphs with small diameter

DOI10.1016/J.DAM.2009.10.002MaRDI QIDQ968157zbMATH OpenOpenAlexFDO

Authors C. Balbuena, Kim Marshall, Luis Pedro Montejano

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

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

Recommendations

• Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)
• Superconnectivity of regular graphs with small diameter
• On the superconnectivity in graphs with odd girth \(g\) and even girth \(h\)
• On the superconnectivity and the conditional diameter of graphs and digraphs
• Lower connectivities of regular graphs with small diameter

Cites work

• scientific article; zbMATH DE number 4162905 (Why is no real title available?)
• scientific article; zbMATH DE number 3735859 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 961975 (Why is no real title available?)
• Circulants and their connectivities
• Connectivity of Regular Directed Graphs with Small Diameters
• Lower connectivities of regular graphs with small diameter
• Maximally connected digraphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Minimum order graphs with specified diameter, connectivity, and regularity
• On the order and size of s-geodetic digraphs with given connectivity
• On the restricted connectivity and superconnectivity in graphs with given girth
• Sufficient conditions for maximally connected dense graphs
• Superconnectivity of regular graphs with small diameter
• Synthesis of reliable networks - a survey

Cited in

(9)

• Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
• Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)
• Connectivity of graphs with given girth pair
• On the connectivity and restricted edge-connectivity of 3-arc graphs
• Lower connectivities of regular graphs with small diameter
• Superconnectivity of regular graphs with small diameter
• On the superconnectivity in graphs with odd girth \(g\) and even girth \(h\)
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
• Linearly many faults in (n,k)-star graphs

This page was built for publication: On the connectivity and superconnected graphs with small diameter

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