The largest graphs with given order and diameter: A simple proof
Combinatorics
2018-11-14 v1
Abstract
A consequence of Ore's classic theorem characterizing the maximal graphs with given order and diameter is a determination of the largest such graphs. We give a very short and simple proof of this smaller result, based on a well-known elementary observation.
Keywords
Cite
@article{arxiv.1811.05314,
title = {The largest graphs with given order and diameter: A simple proof},
author = {Pu Qiao and Xingzhi Zhan},
journal= {arXiv preprint arXiv:1811.05314},
year = {2018}
}