The Largest Graphs with Given Order and Diameter: A Simple Proof

The Largest Graphs with Given Order and Diameter: A Simple Proof

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Graphs and combinatorics 2019-11, Vol.35 (6), p.1715-1716
Hauptverfasser: Qiao, Pu, Zhan, Xingzhi
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorics
Engineering Design
Graphs
Mathematics
Mathematics and Statistics
Original Paper
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-019-02098-z