Advertisement

Large Cayley Graphs and Digraphs with Small Degree and Diameter

  • Paul R. Hafner
Chapter
Part of the Mathematics and Its Applications book series (MAIA, volume 325)

Abstract

We review the status of the Degree/Diameter problem for both graphs and digraphs, and present new Cayley digraphs which yield improvements over some of the previously known largest vertex transitive digraphs of given degree and diameter.

Keywords

Regular Graph Cayley Graph Interconnection Network Semidirect Product Large Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Aschbacher, The nonexistence of rank three permutation groups of degree 3250 and subdegree 57, J. Algebra, 19 (1971), 538–540.MathSciNetCrossRefGoogle Scholar
  2. [2]
    J. Allwright, New (A, D) graphs discovered by heuristic search, Discrete Appl. Math., 37 /38 (1992), 3–8.zbMATHGoogle Scholar
  3. [3]
    R. Bar-Yehuda and T. Etzion, Connections between two cycles—a new design of dense processor interconnection networks, Discrete Appl. Math., 37 /38 (1992), 29–43.MathSciNetGoogle Scholar
  4. [4]
    E. Bannai and T. Ito, On finite Moore graphs, J. Fac. Sci. Univ. Tokyo, 20 (1973), 191–208.MathSciNetzbMATHGoogle Scholar
  5. [5]
    E. Bannai and T. Ito, Regular graphs with excess one, Discrete Math., 37 (1981), 147–158.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    C. T. Benson, Minimal regular graphs of girth eight and twelve, Canad. J. Math., 18 (1966), 1091–1094.zbMATHGoogle Scholar
  7. [7]
    J.-C. Bermond, C. Delorme and G. Farhi, Large graphs with given degree and diameter. II, J. Combin. Theory Ser. B, 36 (1984), 32–48.MathSciNetzbMATHCrossRefGoogle Scholar
  8. [8]
    J.-C. Bermond, C. Delorme and J.-J. Quisquater, Strategies for interconnection networks: some methods from graph theory, Journal of Parallel and Distributed Computing, 3 (1986), 433–449.CrossRefGoogle Scholar
  9. [9]
    J.-C. Bermond, C. Delorme and J.-J. Quisquater, Table of large (A, D)-graphs, Discrete Appl. Math., 37/38 (1992), 575–577.Google Scholar
  10. [10]
    J. Bond, C. Delorme and W. F. de La Vega, Large Cayley graphs with small degree and diameter, Rapport de Recherche no. 392, LRI, Orsay, 1987.Google Scholar
  11. [11]
    W. G. Bridges and S. Toueg, On the impossibility of directed Moore graphs, J. Combin. Theory, 29 (1980), 339–341.MathSciNetzbMATHCrossRefGoogle Scholar
  12. [12]
    L. Campbell, Dense group networks, Discrete Appl. Math., 37 /38 (1992), 65–71.Google Scholar
  13. [13]
    J. Cannon and W. Bosma, Cayley. Quick Reference Guide, Sydney, October 1991.Google Scholar
  14. [14]
    F. Comellas and M. A. Fiol, Vertex symmetric digraphs with small diameter,to appear in Discrete Appl. Math..Google Scholar
  15. [15]
    F. Comellas and J. Gómez, New large graphs with given degree and diameter,To appear in Graph Theory, Combinatorics, and Algorithms: Proceedings of the 7th Quadrennial Internat. Conference on Graph Theory and Applications of Graphs., Yousef Alavi and Allen Schwenk, eds. John Wiley & Sons, Inc. NY.Google Scholar
  16. [16]
    R. Damerell, On Moore graphs, Proc. Cambridge Phil. Soc., 74 (1973), 227–236.zbMATHGoogle Scholar
  17. [17]
    C. Delorme, Grands graphes de degré et diamètre donnés, European J. Combin., 6 (1985), 291–302.zbMATHGoogle Scholar
  18. [18]
    C. Delorme, Large bipartite graphs with given degree and diameter, J. Graph Theory, 9 (1985), 325–334.MathSciNetzbMATHCrossRefGoogle Scholar
  19. [19]
    C. Delorme, Examples of products giving large graphs with given degree and diameter, Discrete Appl. Math., 37/38 (1992), 157–167.Google Scholar
  20. [20]
    C. Delorme and G. Farhi, Large graphs with given degree and diameter. I, IEEE Trans. Computers, C-33 (1984), 857–860.Google Scholar
  21. [21]
    M. J. Dinneen, Algebraic Methods for Efficient Network Constructions, Master’s Thesis, Department of Computer Science, University of Victoria, Victoria, B.C., Canada, 1991.Google Scholar
  22. [22]
    M. J. Dinneen and R. R. Hafner, New results for the degree/diameter problem, Networks 24, (1994) 359–367.MathSciNetzbMATHCrossRefGoogle Scholar
  23. [23]
    D.-Z Du, Y.-D. Lyuu and D. F. Hsu, Line digraph iteration and the spread concept—with application to graph theory, fault tolerance and routing, Graph-theoretic concepts in Computer Science (G. Schmidt, R. Berhammer, eds.), LNCS 570, Springer-Verlag (1992).Google Scholar
  24. [24]
    B. Elspas, Topological constraints on interconnection-limited logic, Proc. 5th Ann. Symp. Switching Circuit Theory and Logic Design (1964), 133–147.Google Scholar
  25. [25]
    P. Erdös, S. Fajtlowicz and A. J. Hoffman, Maximum degree in graphs of diameter 2, Networks, 10 (1980), 87–90.MathSciNetzbMATHCrossRefGoogle Scholar
  26. [26]
    V. Faber and J. W. Moore, High-degree low-diameter interconnection networks with vertex symmetry: the directed case, Technical Report LA-UR-88–1051, Los Alamos National Laboratory, Los Alamos, New Mexico, 1988.Google Scholar
  27. [27]
    V. Faber, J. W. Moore and W. Y. C. Chen, Cycle prefix digraphs for interconnection networks, Networks 23, (1993) 641–649.MathSciNetzbMATHCrossRefGoogle Scholar
  28. [28]
    M. A. Fiol, L. A. Yebra and I. Alegre de Miguel, Line digraph iteration and the (d, k) digraph problem, IEEE Trans. Computers, C-33 (1984), 400–403.Google Scholar
  29. [29]
    J. Gómez, M. A. Fiol and O. Serra, On large (A, D)-graphs,Discrete Math., to appear.Google Scholar
  30. [30]
    W. H. Haemers, Eigenvalue techniques in design and graph theory, Mathematical Centre Tracts 121, Mathematisch Centrum, Amsterdam, 1980.Google Scholar
  31. [31]
    A. J. Hoffman and R. R. Singleton, On Moore graphs with diameters 2 and 3, IBM J. Res. Develop., 64 (1960), 15–21.Google Scholar
  32. [32]
    L. K. Jorgensen, Diameters of cubic graphs, Discrete Appl. Math., 37/38 (1992), 347–351.Google Scholar
  33. [33]
    W. H. Kautz, Bounds on directed (d, k) graphs, Theory of cellular logic networks and machines, AFCRL-68–0668, SRI Project 7258, Final Report, pp. 20–28 (1968).Google Scholar
  34. [34]
    W. H. Kautz, Design of optimal interconnection networks for multiprocessors, Architecture and design of digital computers, Nato Advanced Summer Institute, 249–272 (1969).Google Scholar
  35. [35]
    J. Plesnfk and S. Znâm, Strongly geodetic directed graphs, Acta Fac. Rer. Nat. Univ. Comen., Math., 29 (1974), 29–34.Google Scholar
  36. [36]
    J.-J. Quisquater, Structures d’interconnection: constructions et applications, Thèse d’état, LRI, Orsay Cedex (1987).Google Scholar
  37. [37]
    G. Sabidussi, Vertex transitive graphs, Monatsh. Math., 68 (1969), 426–438.Google Scholar
  38. [38]
    S. T. Schibell and R. M. Stafford, Processor interconnection networks from Cayley graphs, Discrete Appl. Math., 40 (1992), 333–357.MathSciNetzbMATHGoogle Scholar
  39. [39]
    R. Storwick, Improved construction techniques for (d, k) graphs, IEEE Trans. Computers, C-19 (1970), 1214–1216.Google Scholar
  40. [40]
    C. von Conta, TORUS and other networks as communication networks with up to some hundred points,IEEE Trans. Computers, C-32 (1983), 657–666.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1995

Authors and Affiliations

  • Paul R. Hafner
    • 1
  1. 1.Department of MathematicsUniversity of AucklandAucklandNew Zealand

Personalised recommendations