Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)
From MaRDI portal
Publication:617642
DOI10.1016/J.DAM.2010.10.003zbMath1203.05081OpenAlexW1986892593MaRDI QIDQ617642
Luis Pedro Montejano, Camino Balbuena, Pedro García-Vázquez
Publication date: 21 January 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.10.003
Cites Work
- Unnamed Item
- Connectivity of graphs with given girth pair
- On the restricted connectivity and superconnectivity in graphs with given girth
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On the connectivity and superconnected graphs with small diameter
- Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
- Superconnectivity of regular graphs with small diameter
- Sufficient conditions for maximally connected dense graphs
- Graphs of diameter two with no 4-circuits
- On cages for girth pair \((6,b)\)
- Graphs without quadrilaterals
- On the number of edges of quadrilateral-free graphs
- Connectivity of Regular Directed Graphs with Small Diameters
- Regular graphs with given girth pair
- Circulants and their connectivities
- A lower bound on the order of regular graphs with given girth pair
- Synthesis of reliable networks - a survey
- Maximally connected digraphs
Related Items (3)
On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\) ⋮ Diameter, short paths and superconnectivity in digraphs ⋮ On the chromatic number of the Erdős-Rényi orthogonal polarity graph
This page was built for publication: Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)
