MAXIMUM DEGREE IN GRAPHS OF DIAMETER 2.

P. Erdős, Siemion Fajtlowicz, Alan J. Hoffman

Research output: Contribution to journalArticle

58 Citations (Scopus)

Abstract

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

Original languageEnglish
Pages (from-to)87-90
Number of pages4
JournalNetworks
Volume10
Issue number1
Publication statusPublished - Mar 1980

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Erdős, P., Fajtlowicz, S., & Hoffman, A. J. (1980). MAXIMUM DEGREE IN GRAPHS OF DIAMETER 2. Networks, 10(1), 87-90.

MAXIMUM DEGREE IN GRAPHS OF DIAMETER 2. / Erdős, P.; Fajtlowicz, Siemion; Hoffman, Alan J.

In: Networks, Vol. 10, No. 1, 03.1980, p. 87-90.

Research output: Contribution to journalArticle

Erdős, P, Fajtlowicz, S & Hoffman, AJ 1980, 'MAXIMUM DEGREE IN GRAPHS OF DIAMETER 2.', Networks, vol. 10, no. 1, pp. 87-90.
Erdős P, Fajtlowicz S, Hoffman AJ. MAXIMUM DEGREE IN GRAPHS OF DIAMETER 2. Networks. 1980 Mar;10(1):87-90.
Erdős, P. ; Fajtlowicz, Siemion ; Hoffman, Alan J. / MAXIMUM DEGREE IN GRAPHS OF DIAMETER 2. In: Networks. 1980 ; Vol. 10, No. 1. pp. 87-90.
@article{22f02c28aa4e475395c061d3e353714d,
title = "MAXIMUM DEGREE IN GRAPHS OF DIAMETER 2.",
abstract = "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 plus 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.",
author = "P. Erdős and Siemion Fajtlowicz and Hoffman, {Alan J.}",
year = "1980",
month = "3",
language = "English",
volume = "10",
pages = "87--90",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - MAXIMUM DEGREE IN GRAPHS OF DIAMETER 2.

AU - Erdős, P.

AU - Fajtlowicz, Siemion

AU - Hoffman, Alan J.

PY - 1980/3

Y1 - 1980/3

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

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

UR - http://www.scopus.com/inward/record.url?scp=0018998431&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0018998431&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0018998431

VL - 10

SP - 87

EP - 90

JO - Networks

JF - Networks

SN - 0028-3045

IS - 1

ER -