NEW RESULTS FOR THE DEGREE DIAMETER PROBLEM

被引：18
作者：
DINNEEN, MJ [1 ]
HAFNER, PR [1 ]
机构：
[1] UNIV AUCKLAND,DEPT MATH & STAT,AUCKLAND,NEW ZEALAND
来源：
NETWORKS | 1994年 / 24卷 / 07期
关键词：
D O I：
10.1002/net.3230240702
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The results of computer searches for large graphs with given (small) degree and diameter are presented. The new graphs are Cayley graphs of semidirect products of cyclic groups and related groups. One fundamental use of our ''dense graphs'' is in the design of efficient communication network topologies. (C) 1994 John Wiley & Sons, Inc.
引用
收藏
页码：359 / 367
页数：9
相关论文
共 26 条
  • [21] ELSPAS B, 1964, 5TH P ANN S SWITCH C, P133
  • [22] MAXIMUM DEGREE IN GRAPHS OF DIAMETER-2
    ERDOS, P
    FAJTLOWICZ, S
    HOFFMAN, AJ
    [J]. NETWORKS, 1980, 10 (01) : 87 - 90
  • [23] ON LARGE (DELTA, D)-GRAPHS
    GOMEZ, J
    FIOL, MA
    SERRA, O
    [J]. DISCRETE MATHEMATICS, 1993, 114 (1-3) : 219 - 235
  • [24] Hoffman A.J., 1960, IBM J RES DEV, V64, P15
  • [25] SABIDUSSI G, 1969, MONATSH MATH, V68, P426
  • [26] Storwick R. M., 1970, IEEE Transactions on Computers, VC-19, P1214, DOI 10.1109/T-C.1970.222861
123