Deakin University
Browse

File(s) under permanent embargo

New Largest Graphs of Diameter 6. (Extended Abstract)

journal contribution
posted on 2006-07-15, 00:00 authored by Guillermo Pineda VillavicencioGuillermo Pineda Villavicencio, J Gómez, M Miller, H Pérez-Rosés
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. © 2006 Elsevier B.V. All rights reserved.

History

Journal

Electronic Notes in Discrete Mathematics

Volume

24

Pagination

153-160

Location

Amsterdam, The Netherlands

ISSN

1571-0653

eISSN

1571-0653

Publication classification

CN.1 Other journal article

Publisher

Elsevier

Usage metrics

    Research Publications

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC