The largest graphs with given order and diameter: A simple proof
classification
🧮 math.CO
keywords
graphsdiametergivenlargestorderproofsimplecharacterizing
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.