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

Pu Qiao; Xingzhi Zhan

doi:10.1007/s00373-019-02098-z

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

Pu Qiao^*
, Xingzhi Zhan

^*Corresponding author for this work

School of Mathematical Sciences

East China Normal University

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

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.

Original language	English
Pages (from-to)	1715-1716
Number of pages	2
Journal	Graphs and Combinatorics
Volume	35
Issue number	6
DOIs	https://doi.org/10.1007/s00373-019-02098-z
State	Published - 1 Nov 2019

Keywords

Diameter
Extremal graphs
Size

Access to Document

10.1007/s00373-019-02098-z

Cite this

@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",

}

TY - JOUR

T1 - The Largest Graphs with Given Order and Diameter

T2 - A Simple Proof

AU - Qiao, Pu

AU - Zhan, Xingzhi

PY - 2019/11/1

Y1 - 2019/11/1

N2 - 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.

AB - 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.

KW - Diameter

KW - Extremal graphs

KW - Size

UR - https://www.scopus.com/pages/publications/85073823351

U2 - 10.1007/s00373-019-02098-z

DO - 10.1007/s00373-019-02098-z

M3 - 文章

AN - SCOPUS:85073823351

SN - 0911-0119

VL - 35

SP - 1715

EP - 1716

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 6

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Cite this