@article{81dafdb87b0f4c1da2f0a57d21251f30,
title = "The Largest Graphs with Given Order and Diameter: A Simple Proof",
abstract = "A classic theorem of Ore determines the maximum size of graphs with given order and diameter. We give a very short and simple proof of this result, based on a well-known observation.",
keywords = "Diameter, Extremal graphs, Size",
author = "Pu Qiao and Xingzhi Zhan",
note = "Publisher Copyright: {\textcopyright} 2019, Springer Japan KK, part of Springer Nature.",
year = "2019",
month = nov,
day = "1",
doi = "10.1007/s00373-019-02098-z",
language = "英语",
volume = "35",
pages = "1715--1716",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "6",
}