On the minimum number of edges of two-connected graphs with given diameter

DOI10.1016/J.DISC.2011.11.017zbMATH Open1238.05137OpenAlexW1976569371MaRDI QIDQ409426

J. Herrera, H. S. Yoon

Publication date: 13 April 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.11.017

zbMATH Keywords

diameter2-connectedness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal graphs of diameter 4
• Extremal 2-connected graphs with given diameter
• The smallest number of edges in a 2-connected graph with specified diameter
• On Moore Graphs with Diameters 2 and 3
• Extremal graphs of diameter at most 6 after deleting any vertex
• A problem of the theory of communication networks
• On some extremal graphs
• There is No Irregular Moore Graph

Related Items (2)

Unnamed Item ⋮ Note on minimally \(d\)-rainbow connected graphs

This page was built for publication: On the minimum number of edges of two-connected graphs with given diameter