The best known
vertex transitive
In geometry, a polytope (e.g. a polygon or polyhedron) or a tiling is isogonal or vertex-transitive if all its vertices are equivalent under the symmetries of the figure. This implies that each vertex is surrounded by the same kinds of face in ...
digraphs (as of October 2008) in the directed
Degree diameter problem
In graph theory, the degree diameter problem is the problem of finding the largest possible graph (in terms of the size of its vertex set ) of diameter such that the largest degree of any of the vertices in is at most . The size of is boun ...
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
*
*
*
*
*
* {{citation
, last1 = Loz
, first1 = Eyal
, last2 = Širáň
, first2 = Jozef
, title = New record graphs in the degree-diameter problem
, journal = Australasian Journal of Combinatorics
, volume = 41
, year = 2008
, pages = 63–80
, url = http://ajc.maths.uq.edu.au/pdf/41/ajc_v41_p063.pdf
External links
Vertex-symmetric Digraphsonline table.
The Degree - Diameter Problem on CombinatoricsWiki.org
Eyal Loz'sDegree-Diameter problem page.
Directed graphs