### 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 language | English |
---|---|

Pages (from-to) | 87-90 |

Number of pages | 4 |

Journal | Networks |

Volume | 10 |

Issue number | 1 |

Publication status | Published - Mar 1980 |

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*Networks*,

*10*(1), 87-90.

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

Research output: Contribution to journal › Article

*Networks*, vol. 10, no. 1, pp. 87-90.

}

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 -