Title of article
New Largest Graphs of Diameter 6: (Extended Abstract)
Author/Authors
Guillermo Pineda-Villavicencio، نويسنده , , Guillermo and Gَmez، نويسنده , , José and Miller، نويسنده , , Mirka and Pérez-Rosés، نويسنده , , Hebert، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
8
From page
153
To page
160
Abstract
In the pursuit of obtaining largest graphs of given degree and diameter, many construction techniques have arisen. Compounding of graphs is one such technique. In this paper, by means of the compounding of complete graphs into the bipartite Moore graph of diameter 6, we obtain two families of (Δ, 6)-graphs. For maximum degree Δ > 4, being Δ − 1 a prime power, the members of these families constitute the largest known graphs of diameter 6.
Keywords
bipartite Moore graphs , Degree/diameter problem , compounding of graphs
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2006
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454286
Link To Document