Premium
New largest known graphs of diameter 6
Author(s) -
PinedaVillavicencio Guillermo,
Gómez José,
Miller Mirka,
PérezRosés Hebert
Publication year - 2009
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20269
Subject(s) - bipartite graph , combinatorics , compounding , indifference graph , cograph , pathwidth , mathematics , 1 planar graph , chordal graph , graph , computer science , discrete mathematics , line graph , materials science , composite material
In the pursuit of obtaining largest graphs of given maximum degree Δ and diameter D , many construction techniques have been developed. Compounding of graphs is one such technique. In this article, by means of the compounding of complete graphs into a bipartite Moore graph of diameter 6, we obtain a family of large graphs of the same diameter. For maximum degrees Δ = 5, 6, 9, 12, and 14, members of this family constitute the largest known graphs of diameter 6. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom