New large graphs with given degree and diameter six

被引：0
|
作者：
Gómez, J
Pelayo, I
Balbuena, C
机构：
[1] ETSET Barcelona, Dept Matemat Aplicada & Telemat, Barcelona 08034, Spain
[2] Univ Politecn Catalunya, Dept Matemat Aplicada 3, Barcelona, Spain
来源：
NETWORKS | 1999年 / 34卷 / 02期
关键词：
D O I：
10.1002/(SICI)1097-0037(199909)34:2<154::AID-NET8>3.0.CO;2-7
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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. (C) 1999 John Wiley & Sons, Inc. Networks 34: 154-161, 1999.
引用
收藏
页码：154 / 161
页数：8
相关论文
共 50 条
12345