Table of vertex symmetric digraphs

Table of vertex symmetric digraphs

=Table of the orders of the largest known vertex symmetric graphs for the directed Degree Diameter problem=

Below is the table of the best known vertex transitive digraphs (as of October 2008) in the directed Degree diameter problem.



The following table is the key to the colors in the table presented above:



References

* citation
last1 = Kautz
first1 = W.H.
title = Design of optimal interconnection networks for multiprocessors
journal = Architecture and Design of Digital Computers, Nato Advanced Summer Institute
year = 1969
pages = 249-272

* citation
last1 = Faber
first1 = V.
last2 = Moore
first2 = J.W.
title = High-degree low-diameter interconnection networks with vertex symmetry:the directed case
journal = Technical Report LA-UR-88-1051, Los Alamos National Laboratory
year = 1988

* citation
last1 = J. Dinneen
first1 = Michael
last2 = Hafner
first2 = Paul R.
title = New Results for the Degree/Diameter Problem
journal = Networks
volume = 24
issue = 7
year = 1994
pages = 359-367
url = http://arxiv.org/PS_cache/math/pdf/9504/9504214v1.pdf

* citation
last1 = Comellas
first1 = F.
last2 = Fiol
first2 = M.A.
title = Vertex symmetric digraphs with small diameter
journal = Discrete Applied Mathematics
volume = 58
year = 1995
pages = 1-12

* citation
last1 = Miller
first1 = Mirka
last2 = Širáň
first2 = Jozef
title = Moore graphs and beyond: A survey of the degree/diameter problem
journal = Electronic Journal of Combinatorics
volume = Dynamic survey D
year = 2005
url = http://www.combinatorics.org/Surveys/ds14.ps

* 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/volume_contents.php3?vol=41

External links

* [http://maite71.upc.es/grup_de_grafs/table_g.html Vertex-symmetric Digraphs] online table.
* [http://moorebound.indstate.edu/index.php/Main_Page Degree Diameter] self-update wiki.
* [http://www.eyal.tk/degreediameter/ Eyal Loz] 's Degree-Diameter problem page.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Degree diameter problem — In graph theory, the degree diameter problem is the problem of finding the largest possible graph G (in terms of the size of its vertex set V) of diameter k such that the largest degree of any of the vertices in G is at most d. The size of G is… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”