The largest graphs with given order and diameter: a simple proof

DOI10.1007/s00373-019-02098-zzbMath1431.05059arXiv1811.05314OpenAlexW2972963932WikidataQ127242231 ScholiaQ127242231MaRDI QIDQ2287761

Xingzhi Zhan, Pu Qiao

Publication date: 21 January 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.05314

zbMATH Keywords

extremal graphsdiametersize

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (1)

A simple proof of Ore's theorem on the maximum size of \(k\)-connected graphs with given order and diameter

Cites Work

• Diameters in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The largest graphs with given order and diameter: a simple proof