Table of vertex-symmetric digraphs
The best known vertex transitive digraphs (as of October 2008) in the directed Degree diameter problem are tabulated below.
Table of the orders of the largest known vertex-symmetric graphs for the directed degree diameter problem
The footnotes in the table indicate the origin of the digraph that achieves the given number of vertices:
References
- Kautz, W.H. (1969), "Design of optimal interconnection networks for multiprocessors", Architecture and Design of Digital Computers, Nato Advanced Summer Institute: 249–272
- Faber, V.; Moore, J.W. (1988), "High-degree low-diameter interconnection networks with vertex symmetry:the directed case", Technical Report LA-UR-88-1051, los Alamos National Laboratory
- J. Dinneen, Michael; Hafner, Paul R. (1994), "New Results for the Degree/Diameter Problem", Networks, 24 (7): 359–367, arXiv:math/9504214, doi:10.1002/net.3230240702
- Comellas, F.; Fiol, M.A. (1995), "Vertex-symmetric digraphs with small diameter", Discrete Applied Mathematics, 58 (1): 1–12, doi:10.1016/0166-218X(93)E0145-O
- Miller, Mirka; Širáň, Jozef (2005), "Moore graphs and beyond: A survey of the degree/diameter problem" (PDF), Electronic Journal of Combinatorics, Dynamic, survey D
- Loz, Eyal; Širáň, Jozef (2008), "New record graphs in the degree-diameter problem" (PDF), Australasian Journal of Combinatorics, 41: 63–80
External links
- Vertex-symmetric Digraphs online table.
- The Degree - Diameter Problem on CombinatoricsWiki.org.
- Eyal Loz's Degree-Diameter problem page.