Superconnectivity of graphs with odd girth g and even girth h

DOI10.1016/J.DAM.2010.10.003MaRDI QIDQ617642zbMATH OpenOpenAlexFDO

Authors C. Balbuena, Luis Pedro Montejano, P. 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

zbMATH Keywords

diametergirthgirth pairpolarity graphssuperconnectivity

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Recommendations

• On the superconnectivity in graphs with odd girth \(g\) and even girth \(h\)
• Superconnectivity of regular graphs with small diameter
• On the connectivity and superconnected graphs with small diameter
• On the restricted connectivity and superconnectivity in graphs with given girth
• Sufficient conditions for graphs to be super connected

Cites work

• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• A lower bound on the order of regular graphs with given girth pair
• Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size
• Circulants and their connectivities
• Connectivity of Regular Directed Graphs with Small Diameters
• Connectivity of graphs with given girth pair
• Graphs of diameter two with no 4-circuits
• Graphs without quadrilaterals
• Maximally connected digraphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On cages for girth pair \((6,b)\)
• On the connectivity and superconnected graphs with small diameter
• On the number of edges of quadrilateral-free graphs
• On the restricted connectivity and superconnectivity in graphs with given girth
• Regular graphs with given girth pair
• Sufficient conditions for maximally connected dense graphs
• Superconnectivity of regular graphs with small diameter
• Synthesis of reliable networks - a survey

Cited in

(6)

• 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
• On the connectivity and superconnected graphs with small diameter
• Superconnectivity of regular graphs with small diameter
• On the superconnectivity in graphs with odd girth \(g\) and even girth \(h\)

This page was built for publication: Superconnectivity of graphs with odd girth \(g\) and even girth \(h\)

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