A characterization of the non-trivial diameter two graphs of minimum size

DOI10.1016/j.dam.2015.02.009zbMath1315.05042OpenAlexW2037198398MaRDI QIDQ2348058

Michael A. Henning, Justin Southey

Publication date: 10 June 2015

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

Full work available at URL: https://doi.org/10.1016/j.dam.2015.02.009

zbMATH Keywords

boundssizediameter two graphs

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (1)

Proof of a conjecture on the Wiener index of Eulerian graphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of the non-trivial diameter two graphs of minimum size