Premium
New large graphs with given degree and diameter six
Author(s) -
Gómez J.,
Pelayo I.,
Balbuena C.
Publication year - 1999
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/(sici)1097-0037(199909)34:2<154::aid-net8>3.0.co;2-7
Subject(s) - combinatorics , bipartite graph , mathematics , degree (music) , cograph , 1 planar graph , graph , pathwidth , split graph , pancyclic graph , indifference graph , discrete mathematics , line graph , physics , acoustics
In this paper, a method for obtaining large diameter 6 graphs by replacing some vertices of a Moore bipartite diameter 6 graph with complete K h graphs is proposed. These complete graphs are joined to each other and to the remaining nonmodified graphs by means of new edges and by using a special diameter 2 graph. The degree of the graph so constructed coincides with the original one. © 1999 John Wiley & Sons, Inc. Networks 34: 154–161, 1999