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 条
  • [1] AKERS SB, 1987, IEEE T COMPUT, V36, P885, DOI 10.1109/TC.1987.1676983
  • [2] A GROUP-THEORETIC MODEL FOR SYMMETRIC INTERCONNECTION NETWORKS
    AKERS, SB
    KRISHNAMURTHY, B
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (04) : 555 - 566
  • [3] REGULAR GRAPHS WITH EXCESS ONE
    BANNAI, E
    ITO, T
    [J]. DISCRETE MATHEMATICS, 1981, 37 (2-3) : 147 - 158
  • [4] BANNAI E, 1973, J FAC SCI U TOKYO 1, V20, P191
  • [5] CONNECTIONS BETWEEN 2 CYCLES - A NEW DESIGN OF DENSE PROCESSOR INTERCONNECTION NETWORKS
    BARYEHUDA, R
    ETZION, T
    [J]. DISCRETE APPLIED MATHEMATICS, 1992, 37-8 : 29 - 43
  • [6] TABLES OF LARGE GRAPHS WITH GIVEN DEGREE AND DIAMETER
    BERMOND, JC
    DELORME, C
    QUISQUATER, JJ
    [J]. INFORMATION PROCESSING LETTERS, 1982, 15 (01) : 10 - 13
  • [7] TABLE OF LARGE (DELTA,D)-GRAPHS
    BERMOND, JC
    DELORME, C
    QUISQUATER, JJ
    [J]. DISCRETE APPLIED MATHEMATICS, 1992, 37-8 : 575 - 577
  • [8] STRATEGIES FOR INTERCONNECTION NETWORKS - SOME METHODS FROM GRAPH-THEORY
    BERMOND, JC
    DELORME, C
    QUISQUATER, JJ
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1986, 3 (04) : 433 - 449
  • [9] Biggs N., 1974, ALGEBRAIC GRAPH THEO
  • [10] BOND J, 1987, LRI392 RAPP RECH
123