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

DOI10.1016/J.DISC.2011.11.017MaRDI QIDQ409426zbMATH OpenOpenAlexFDO

Authors Aubin Jarry, A. Laugier

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) Distance in graphs (05C12) Enumeration in graph theory (05C30)

Recommendations

• The smallest number of edges in a 2-connected graph with specified diameter
• Extremal 2-connected graphs with given diameter
• scientific article; zbMATH DE number 4008431
• Minimum edge cuts in diameter 2 graphs
• Publication:4509380

Cites work

• scientific article; zbMATH DE number 3831957 (Why is no real title available?)
• scientific article; zbMATH DE number 3674126 (Why is no real title available?)
• scientific article; zbMATH DE number 3218574 (Why is no real title available?)
• scientific article; zbMATH DE number 3309000 (Why is no real title available?)
• A problem of the theory of communication networks
• Extremal 2-connected graphs with given diameter
• Extremal graphs of diameter 4
• Extremal graphs of diameter at most 6 after deleting any vertex
• On Moore Graphs with Diameters 2 and 3
• On some extremal graphs
• The smallest number of edges in a 2-connected graph with specified diameter
• There is No Irregular Moore Graph

Cited in

(9)

• Note on minimally \(d\)-rainbow connected graphs
• scientific article; zbMATH DE number 4008431 (Why is no real title available?)
• On the number of edges in a graph with many two-hop disjoint paths
• Plane graphs with large faces and small diameter
• scientific article; zbMATH DE number 6119667 (Why is no real title available?)
• scientific article; zbMATH DE number 1517141 (Why is no real title available?)
• The smallest number of edges in a 2-connected graph with specified diameter
• A characterization of the non-trivial diameter two graphs of minimum size
• Minimum edge cuts in diameter 2 graphs

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

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