<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en-GB">
	<id>http://combinatoricswiki.org/index.php?action=history&amp;feed=atom&amp;title=The_Degree_Diameter_Problem_for_Vertex_Symmetric_Digraphs</id>
	<title>The Degree Diameter Problem for Vertex Symmetric Digraphs - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://combinatoricswiki.org/index.php?action=history&amp;feed=atom&amp;title=The_Degree_Diameter_Problem_for_Vertex_Symmetric_Digraphs"/>
	<link rel="alternate" type="text/html" href="http://combinatoricswiki.org/index.php?title=The_Degree_Diameter_Problem_for_Vertex_Symmetric_Digraphs&amp;action=history"/>
	<updated>2026-05-21T22:37:44Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.31.1</generator>
	<entry>
		<id>http://combinatoricswiki.org/index.php?title=The_Degree_Diameter_Problem_for_Vertex_Symmetric_Digraphs&amp;diff=313&amp;oldid=prev</id>
		<title>Grahame: 1 revision imported</title>
		<link rel="alternate" type="text/html" href="http://combinatoricswiki.org/index.php?title=The_Degree_Diameter_Problem_for_Vertex_Symmetric_Digraphs&amp;diff=313&amp;oldid=prev"/>
		<updated>2019-01-03T14:39:33Z</updated>

		<summary type="html">&lt;p&gt;1 revision imported&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en-GB&quot;&gt;
				&lt;td colspan=&quot;1&quot; style=&quot;background-color: #fff; color: #222; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;1&quot; style=&quot;background-color: #fff; color: #222; text-align: center;&quot;&gt;Revision as of 14:39, 3 January 2019&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-notice&quot; lang=&quot;en-GB&quot;&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Grahame</name></author>
		
	</entry>
	<entry>
		<id>http://combinatoricswiki.org/index.php?title=The_Degree_Diameter_Problem_for_Vertex_Symmetric_Digraphs&amp;diff=312&amp;oldid=prev</id>
		<title>CW&gt;Gpineda: /* References */</title>
		<link rel="alternate" type="text/html" href="http://combinatoricswiki.org/index.php?title=The_Degree_Diameter_Problem_for_Vertex_Symmetric_Digraphs&amp;diff=312&amp;oldid=prev"/>
		<updated>2013-05-21T13:02:29Z</updated>

		<summary type="html">&lt;p&gt;‎&lt;span dir=&quot;auto&quot;&gt;&lt;span class=&quot;autocomment&quot;&gt;References&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;==Introduction==&lt;br /&gt;
&lt;br /&gt;
The '''degree/diameter problem for vertex-transitive digraphs''' can be stated as follows:&lt;br /&gt;
&lt;br /&gt;
''Given natural numbers ''d'' and ''k'', find the largest possible number ''DN&amp;lt;sup&amp;gt;vt&amp;lt;/sup&amp;gt;(d,k)'' of vertices in a [http://en.wikipedia.org/wiki/Vertex-transitive_graph vertex-transitive digraph] of maximum out-degree ''d'' and diameter ''k''.&lt;br /&gt;
&lt;br /&gt;
There are no better upper bounds for ''DN&amp;lt;sup&amp;gt;vt&amp;lt;/sup&amp;gt;(d,k)'' than the very general directed ''Moore bounds'' ''DM(d,k)=(d&amp;lt;sup&amp;gt;k+1&amp;lt;/sup&amp;gt;-1)(d-1)&amp;lt;sup&amp;gt;-1&amp;lt;/sup&amp;gt;''. &lt;br /&gt;
&lt;br /&gt;
Therefore, in attempting to settle the values of ''DN&amp;lt;sup&amp;gt;vt&amp;lt;/sup&amp;gt;(d,k)'', research activities in this problem follow the next two directions:&lt;br /&gt;
&lt;br /&gt;
* Increasing the lower bounds for ''DN&amp;lt;sup&amp;gt;vt&amp;lt;/sup&amp;gt;(d,k)'' by constructing ever larger vertex-transitive digraphs.&lt;br /&gt;
&lt;br /&gt;
* Lowering and/or setting upper bounds for ''DN&amp;lt;sup&amp;gt;vt&amp;lt;/sup&amp;gt;(d,k)'' by proving the non-existence of vertex-transitive digraphs whose order is close to the directed Moore bounds ''DM(d,k)''.&lt;br /&gt;
&lt;br /&gt;
==Increasing the lower bounds for DN&amp;lt;sup&amp;gt;vt&amp;lt;/sup&amp;gt;(d,k)==&lt;br /&gt;
&lt;br /&gt;
Below is the table of the largest known digraphs (as of October 2008) in the [[The Degree/Diameter Problem | degree diameter problem]] for digraphs of [http://en.wikipedia.org/wiki/Outdegree out-degree] at most 3&amp;amp;nbsp;≤&amp;amp;nbsp;''d''&amp;amp;nbsp;≤&amp;amp;nbsp;16 and [http://en.wikipedia.org/wiki/Distance_(graph_theory) diameter] 2&amp;amp;nbsp;≤&amp;amp;nbsp;''k''&amp;amp;nbsp;≤&amp;amp;nbsp;10. Only a few of the vertex-transitive digraphs in this table are known to be optimal (marked in bold), and thus, finding a larger vertex-transitive digraph whose order (in terms of the order of the vertex set) is close to the directed Moore bound is considered an [http://en.wikipedia.org/wiki/Open_problem open problem]. &lt;br /&gt;
&lt;br /&gt;
===Table of the orders of the largest known vertex-symmetric graphs for the directed degree diameter problem===&lt;br /&gt;
Digraphs in bold are optimal.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt; &lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellspacing=&amp;quot;2&amp;quot; cellpadding=&amp;quot;2&amp;quot; style=&amp;quot;text-align: center;&amp;quot;&lt;br /&gt;
| '''d\k'''||  '''2''' ||  '''3''' ||  '''4'''|| '''5''' ||  '''6''' || '''7''' ||  '''8''' ||  '''9''' ||  '''10''' || '''11'''|| '''12'''&lt;br /&gt;
|-&lt;br /&gt;
| '''2''' ||style=&amp;quot;background-color: blue;&amp;quot; | '''6''' ||style=&amp;quot;background-color: #99FF00;&amp;quot; | 10 ||style=&amp;quot;background-color: #FF0033;&amp;quot; | 20 ||style=&amp;quot;background-color: #FF0033;&amp;quot; | 27 ||style=&amp;quot;background-color: #663333;&amp;quot; | 72 ||style=&amp;quot;background-color: #663333;&amp;quot; | 144 ||style=&amp;quot;background-color: #99FF00;&amp;quot; | 171 ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 336 ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 504 ||style=&amp;quot;background-color: #99FF00;&amp;quot; | 737 ||style=&amp;quot;background-color: #666666;&amp;quot; |  &lt;br /&gt;
|-&lt;br /&gt;
| '''3''' ||style=&amp;quot;background-color: blue;&amp;quot; | '''12''' ||style=&amp;quot;background-color: #FF0033;&amp;quot; | 27 ||style=&amp;quot;background-color: #669999;&amp;quot; | 60 ||style=&amp;quot;background-color: #666633;&amp;quot; | 165 || style=&amp;quot;background-color: #99FF00;&amp;quot; |333 ||style=&amp;quot;background-color: #990099;&amp;quot; | 1 152 ||style=&amp;quot;background-color: #FF9900;&amp;quot; | 2 041 ||style=&amp;quot;background-color: #FF9900;&amp;quot; | 5 115 ||style=&amp;quot;background-color: #FF9900;&amp;quot; | 11 568 ||style=&amp;quot;background-color: #990099;&amp;quot; | 41 472 ||style=&amp;quot;background-color: #666666;&amp;quot; |  &lt;br /&gt;
|-&lt;br /&gt;
| '''4''' ||style=&amp;quot;background-color: blue;&amp;quot; | '''20''' ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 60 ||style=&amp;quot;background-color: #663333;&amp;quot; | 168 ||style=&amp;quot;background-color:  #666666;&amp;quot; | 720 ||style=&amp;quot;background-color: #FF9900;&amp;quot; | 1 378 ||style=&amp;quot;background-color: #990099;&amp;quot; | 7 200 ||style=&amp;quot;background-color: #666666;&amp;quot; | 14 400 ||style=&amp;quot;background-color: #FF9900;&amp;quot; | 42 309 ||style=&amp;quot;background-color:  #666666;&amp;quot; | 172 800 ||style=&amp;quot;background-color:  #666666;&amp;quot; | 1 036 800 ||style=&amp;quot;background-color: #666666;&amp;quot; | 1 296 000&lt;br /&gt;
|-&lt;br /&gt;
| '''5''' ||style=&amp;quot;background-color: blue;&amp;quot; | '''30''' ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 120 ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 360 ||style=&amp;quot;background-color:  #666666;&amp;quot; | 2 520 ||style=&amp;quot;background-color:  #666666;&amp;quot; | 5 040 ||style=&amp;quot;background-color:  #666666;&amp;quot; | 40 320 ||style=&amp;quot;background-color: #666666;&amp;quot; | 86 400 ||style=&amp;quot;background-color:  #666666;&amp;quot; | 362  880 ||style=&amp;quot;background-color:  #666666;&amp;quot; | 1 814 405 ||style=&amp;quot;background-color:  #666666;&amp;quot; | 12 700 800 ||style=&amp;quot;background-color: #666666;&amp;quot; | 15 552 000&lt;br /&gt;
|-&lt;br /&gt;
| '''6''' ||style=&amp;quot;background-color: blue;&amp;quot; | '''42''' ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 210 ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 840 ||style=&amp;quot;background-color:  #666666;&amp;quot; | 6 720 ||style=&amp;quot;background-color:  #666666;&amp;quot; | 20 160 ||style=&amp;quot;background-color: #666666;&amp;quot; | 181 440 ||style=&amp;quot;background-color: #666666;&amp;quot; | 362 880 ||style=&amp;quot;background-color: #666666;&amp;quot; | 3 628 800 ||style=&amp;quot;background-color: #666666;&amp;quot; | 11 289 600 ||style=&amp;quot;background-color: #666666;&amp;quot; | 39 916 800 ||style=&amp;quot;background-color: #666666;&amp;quot; | 270 950 400&lt;br /&gt;
|-&lt;br /&gt;
| '''7''' ||style=&amp;quot;background-color: blue;&amp;quot; | '''56''' ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 336 ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 1 680 ||style=&amp;quot;background-color: #666666;&amp;quot; | 15 120 ||style=&amp;quot;background-color: #666666;&amp;quot; | 60 480 ||style=&amp;quot;background-color: #666666;&amp;quot; | 604 800 ||style=&amp;quot;background-color: #666666;&amp;quot; | 1 814 400 ||style=&amp;quot;background-color: #666666;&amp;quot; | 19 958 400 ||style=&amp;quot;background-color: #666666;&amp;quot; | 50 803 200 ||style=&amp;quot;background-color: #666666;&amp;quot; | 479 001 600 ||style=&amp;quot;background-color: #666666;&amp;quot; | 1 828 915 200&lt;br /&gt;
|-&lt;br /&gt;
| '''8''' ||style=&amp;quot;background-color: blue;&amp;quot; | '''72''' ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 504 ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 3 024 ||style=&amp;quot;background-color: #666666;&amp;quot; | 30 240 ||style=&amp;quot;background-color: #666666;&amp;quot; | 151 200 ||style=&amp;quot;background-color: #666666;&amp;quot; |1 663 200 ||style=&amp;quot;background-color: #666666;&amp;quot; | 6 692 800 ||style=&amp;quot;background-color: #666666;&amp;quot; | 79 833 600 ||style=&amp;quot;background-color: #666666;&amp;quot; | 239 500 800 ||style=&amp;quot;background-color: #666666;&amp;quot; |3  113 510 400 ||style=&amp;quot;background-color: #666666;&amp;quot; | 9 144 576 000&lt;br /&gt;
|-&lt;br /&gt;
| '''9''' ||style=&amp;quot;background-color: blue;&amp;quot; | '''90''' ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 720 ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 5 040 ||style=&amp;quot;background-color: #666666;&amp;quot; | 55 400 ||style=&amp;quot;background-color: #666666;&amp;quot; | 332 640 ||style=&amp;quot;background-color: #666666;&amp;quot; | 3 991 680 ||style=&amp;quot;background-color: #666666;&amp;quot; | 19 958 400 ||style=&amp;quot;background-color: #666666;&amp;quot; | 259 459 200 ||style=&amp;quot;background-color: #666666;&amp;quot; |1 037 836 800 ||style=&amp;quot;background-color: #666666;&amp;quot; | 14 329 715 200 ||style=&amp;quot;background-color: #666666;&amp;quot; | 43 589 145 600&lt;br /&gt;
|-&lt;br /&gt;
| '''10''' ||style=&amp;quot;background-color: blue;&amp;quot; | '''110''' ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 990 ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 7 920 ||style=&amp;quot;background-color: #666666;&amp;quot; | 95 040 ||style=&amp;quot;background-color: #666666;&amp;quot; | 665 280 ||style=&amp;quot;background-color: #666666;&amp;quot; | 8 648 640 ||style=&amp;quot;background-color: #666666;&amp;quot; | 58 891 840 ||style=&amp;quot;background-color: #666666;&amp;quot; | 716 485 750 ||style=&amp;quot;background-color: #666666;&amp;quot; | 3 632 428 800 ||style=&amp;quot;background-color: #666666;&amp;quot; | 54 486 432 000 ||style=&amp;quot;background-color: #666666;&amp;quot; | 217 945 728 000&lt;br /&gt;
|-&lt;br /&gt;
| '''11''' ||style=&amp;quot;background-color: blue;&amp;quot; | '''132''' ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 1 320 ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 11 880 ||style=&amp;quot;background-color: #666666;&amp;quot; | 154 440 ||style=&amp;quot;background-color: #666666;&amp;quot; |1 235 520 ||style=&amp;quot;background-color: #666666;&amp;quot; | 17 297 280 ||style=&amp;quot;background-color: #666666;&amp;quot; | 121 080 960 ||style=&amp;quot;background-color: #666666;&amp;quot; |1 816 214 400 ||style=&amp;quot;background-color: #666666;&amp;quot; | 10 897 286 400 ||style=&amp;quot;background-color: #666666;&amp;quot; | 174 356 582 400 ||style=&amp;quot;background-color: #666666;&amp;quot; | 871 782 912 000&lt;br /&gt;
|-&lt;br /&gt;
| '''12''' ||style=&amp;quot;background-color: blue;&amp;quot; | '''156''' ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 1 716 ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 17 160 ||style=&amp;quot;background-color: #666666;&amp;quot; | 240 240 ||style=&amp;quot;background-color: #666666;&amp;quot; | 2 162 160 ||style=&amp;quot;background-color: #666666;&amp;quot; | 32 432 400 ||style=&amp;quot;background-color: #666666;&amp;quot; | 259 459 200 ||style=&amp;quot;background-color: #666666;&amp;quot; |4 151 347 200 ||style=&amp;quot;background-color: #666666;&amp;quot; | 29 059 430 400 ||style=&amp;quot;background-color: #666666;&amp;quot; | 494 010 316 800 ||style=&amp;quot;background-color: #666666;&amp;quot; | 2 964 061 900 800&lt;br /&gt;
|-&lt;br /&gt;
| '''13''' ||style=&amp;quot;background-color: blue;&amp;quot; | '''182''' ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 2 184 ||style=&amp;quot;background-color: #6666CC;&amp;quot; | 24 024 ||style=&amp;quot;background-color: #666666;&amp;quot; | 360 360 ||style=&amp;quot;background-color: #666666;&amp;quot; | 3 603 600 ||style=&amp;quot;background-color: #666666;&amp;quot; | 57 657 600 ||style=&amp;quot;background-color: #666666;&amp;quot; | 518 918 400 ||style=&amp;quot;background-color: #666666;&amp;quot; | 8 831 612 800 ||style=&amp;quot;background-color: #666666;&amp;quot; | 70 572 902 400 ||style=&amp;quot;background-color: #666666;&amp;quot; | 1 270 312 243 200 ||style=&amp;quot;background-color: #666666;&amp;quot; | 8 892 185 702 400&lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The following table is the key to the colors in the table presented above:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&lt;br /&gt;
{| border=&amp;quot;1&amp;quot; cellspacing=&amp;quot;1&amp;quot; cellpadding=&amp;quot;1&amp;quot; style=&amp;quot;text-align: left;&amp;quot;&lt;br /&gt;
|'''Color''' || style=&amp;quot;text-align: center;&amp;quot; |'''Details'''&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: blue; text-align: center;&amp;quot; | * || Family of digraphs found by W.H.Kautz. More details are available in a paper by the author.&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: #6666CC; text-align: center;&amp;quot; | * || Family of digraphs found by V.Faber and J.W.Moore. More details are available also by other authors.&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: #669999; text-align: center;&amp;quot; | * || Digraph found by V.Faber and J.W.Moore. The complete set of cayley digraphs in that order was found by Eyal Loz. &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: #990099; text-align: center;&amp;quot; | * || Digraphs found by Francesc Comellas and M. A. Fiol. More details are available in a paper by the authors.&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: #99FF00; text-align: center;&amp;quot; | * || Cayley digraphs found by Michael J. Dinneen. Details about this graph are available in a paper by the author.&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: #FF0033; text-align: center;&amp;quot; | * || Cayley digraphs found by Michael J. Dinneen. The complete set of cayley digraphs in that order was found by Eyal Loz. &lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: #663333; text-align: center;&amp;quot; | * ||  Cayley digraphs found by Paul Hafner. Details about this graph are available in a paper by the author.&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: #666633; text-align: center;&amp;quot; | * || Cayley digraph found by Paul Hafner. The complete set of cayley digraphs in that order was found by Eyal Loz.&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: #666666; text-align: center;&amp;quot; | * ||  Digraphs found by J. Gómez. More details are available in two papers by the author.&lt;br /&gt;
|-&lt;br /&gt;
|style=&amp;quot;background-color: #FF9900; text-align: center;&amp;quot; | * || Cayley digraphs found by Eyal Loz. More details are available in a paper by Eyal Loz and Jozef Širáň. &lt;br /&gt;
|}&lt;br /&gt;
&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Lowering and/or setting upper bounds for DN&amp;lt;sup&amp;gt;vt&amp;lt;/sup&amp;gt;(d,k)==&lt;br /&gt;
&lt;br /&gt;
With the exception of the studies done for the general digraphs, no study on this research area has been identified.   &lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
* Comellas, F.; Fiol, M.A. (1995), &amp;quot;Vertex-symmetric digraphs with small diameter&amp;quot;, Discrete Applied Mathematics 58: 1–12.&lt;br /&gt;
* Dinneen, Michael; Hafner, Paul R. (1994), &amp;quot;New Results for the Degree/Diameter Problem&amp;quot;, Networks 24 (7): 359–367, [http://arxiv.org/PS_cache/math/pdf/9504/9504214v1.pdf PDF version] &lt;br /&gt;
* Faber, V.; Moore, J.W. (1988), &amp;quot;High-degree low-diameter interconnection networks with vertex symmetry:the directed case&amp;quot;, Technical Report LA-UR-88-1051, Los Alamos National Laboratory. &lt;br /&gt;
* Gomez, J. (2007), &amp;quot;Large Vertex Symmetric Digraphs&amp;quot;, Networks 50 (4): 241–250.&lt;br /&gt;
* Gomez, J. (2009), &amp;quot;On large vertex symmetric digraphs&amp;quot;, Discrete Mathematics 309 (6) : 1213–1221.&lt;br /&gt;
* Kautz, W.H. (1969), &amp;quot;Design of optimal interconnection networks for multiprocessors&amp;quot;, Architecture and Design of Digital Computers, Nato Advanced Summer Institute: 249–272.&lt;br /&gt;
* Loz, Eyal; Širáň, Jozef (2008), &amp;quot;New record graphs in the degree-diameter problem&amp;quot;, Australasian Journal of Combinatorics 41: 63–80.&lt;br /&gt;
* Miller, Mirka; Širáň, Jozef (2005), &amp;quot;Moore graphs and beyond: A survey of the degree/diameter problem&amp;quot;, Electronic Journal of Combinatorics Dynamic survey D, [http://www.combinatorics.org/Surveys/ds14.pdf PDF version]&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
* [http://maite71.upc.es/grup_de_grafs/table_g.html Vertex-symmetric Digraphs] online table.&lt;br /&gt;
* [http://www.eyal.com.au/wiki/The_Degree/Diameter_Problem Eyal Loz's] Degree-Diameter problem page.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:The Degree/Diameter Problem]]&lt;/div&gt;</summary>
		<author><name>CW&gt;Gpineda</name></author>
		
	</entry>
</feed>