On the connectivity and superconnected graphs with small diameter
From MaRDI portal
Publication:968157
DOI10.1016/J.DAM.2009.10.002zbMATH Open1225.05153OpenAlexW2091627032MaRDI QIDQ968157FDOQ968157
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
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
- Title not available (Why is that?)
- Circulants and their connectivities
- Synthesis of reliable networks - a survey
- Title not available (Why is that?)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Maximally connected digraphs
- On the restricted connectivity and superconnectivity in graphs with given girth
- Connectivity of Regular Directed Graphs with Small Diameters
- Sufficient conditions for maximally connected dense graphs
- On the order and size of \(s\)-geodetic digraphs with given connectivity
- Title not available (Why is that?)
- Minimum order graphs with specified diameter, connectivity, and regularity
- Superconnectivity of regular graphs with small diameter
- Title not available (Why is that?)
- Lower connectivities of regular graphs with small diameter
Cited In (8)
- 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
- 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)
