On the minimum number of edges of two-connected graphs with given diameter
From MaRDI portal
Publication:409426
DOI10.1016/J.DISC.2011.11.017zbMATH Open1238.05137OpenAlexW1976569371MaRDI QIDQ409426FDOQ409426
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
Recommendations
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Enumeration in graph theory (05C30)
Cites Work
- On Moore Graphs with Diameters 2 and 3
- Title not available (Why is that?)
- 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
- Extremal graphs of diameter at most 6 after deleting any vertex
- Title not available (Why is that?)
- Title not available (Why is that?)
- A problem of the theory of communication networks
- On some extremal graphs
- There is No Irregular Moore Graph
- Title not available (Why is that?)
Cited In (9)
- Note on minimally \(d\)-rainbow connected graphs
- Title not available (Why is that?)
- On the number of edges in a graph with many two-hop disjoint paths
- Plane graphs with large faces and small diameter
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
