Title of article
New Large Graphs with Given Degree and Diameter Six
Author/Authors
GOMEZ-REINO، J. J. نويسنده , , Pelayo، I. نويسنده , , Balbuena، C. نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
-153
From page
154
To page
0
Abstract
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(n) 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
Keywords
eccentricity , center , periphery , distance
Journal title
NETWORKS
Serial Year
1999
Journal title
NETWORKS
Record number
13493
Link To Document