The Degree/Diameter Problem for mixed abelian Cayley graphs

Abstract This paper investigates the upper bounds for the number of vertices in mixed abelian Cayley graphs with given degree and diameter. Additionally, in the case when the undirected degree is equal to one, we give a construction that provides a lower bound.

[1]  Randall Dougherty,et al.  The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case , 2004, SIAM J. Discret. Math..

[2]  Chak-Kuen Wong,et al.  A Combinatorial Problem Related to Multimodule Memory Organizations , 1974, JACM.

[3]  S. A. Tishchenko.  Maximum size of a planar graph with given degree and even diameter , 2012, Eur. J. Comb..

[4]  Tomás Vetrík,et al.  Cayley graphs of given degree and diameters 3, 4 and 5 , 2013, Discret. Math..

[5]  Tomás Vetrík,et al.  Large Cayley graphs and vertex‐transitive non‐Cayley graphs of given degree and diameter , 2010, J. Graph Theory.

[6]  J. Sirán,et al.  Moore Graphs and Beyond: A survey of the Degree/Diameter Problem , 2013 .

[7]  Jhing-Fa Wang,et al.  Reliable circulant networks with minimum transmission delay , 1985 .

[8]  Hebert Pérez-Rosés,et al.  A revised Moore bound for mixed graphs , 2015, Discret. Math..

[9]  Hebert Pérez-Rosés,et al.  Searching for Large Multi-Loop Networks , 2014, Electron. Notes Discret. Math..

[10]  Hebert Pérez-Rosés,et al.  The maximum degree and diameter-bounded subgraph in the mesh , 2012, Discret. Appl. Math..

[11]  Mirka Miller,et al.  On large bipartite graphs of diameter 3 , 2012, Discret. Math..

[12]  Frether Getachew,et al.  Objects Counted by Central Delannoy Numbers , 2013 .

[13]  Tomás Vetrík,et al.  Large vertex-transitive and Cayley graphs with given degree and diameter , 2007, Electron. Notes Discret. Math..

[14]  Borut Robic,et al.  Restricted shortest paths in 2-circulant graphs , 2009, Comput. Commun..

[15]  Marko Petkovšek,et al.  A=B : 等式証明とコンピュータ , 1997 .

[16]  Emilia A. Monakhova,et al.  A Survey on Undirected circulant Graphs , 2012, Discret. Math. Algorithms Appl..

[17]  George S. Lueker,et al.  Some Techniques for Solving Recurrences , 1980, CSUR.

[18]  Michael R. Fellows,et al.  Large Planar Graphs with Given Diameter and Maximum Degree , 1995, Discret. Appl. Math..

[19]  Joe Ryan,et al.  Searching for Large Circulant Graphs , 2015, 1503.07357.

[20]  R. Stanton,et al.  Note on a “Square” Functional Equation , 1970 .