| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653135 | Electronic Notes in Discrete Mathematics | 2006 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
