Premium
Maximum degree in graphs of diameter 2
Author(s) -
Erdös Paul,
Fajtlowicz Siemion,
Hoffman Alan J.
Publication year - 1980
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230100109
Subject(s) - degree (music) , combinatorics , mathematics , metric dimension , chordal graph , indifference graph , discrete mathematics , 1 planar graph , graph , physics , acoustics
It is well known that there are at most four Moore graphs of diameter 2, i.e., graphs of diameter 2, maximum degree d , and d 2 + 1 vertices. The purpose of this paper is to prove that with the exception of C 4 , there are no graphs of diameter 2, of maximum degree d , and with d 2 vertices.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom