An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first show these bounds can be improved if we know more details about the order of some elements of the generating set. Based on these improvements, we present some new families of mixed graphs. For every fixed value of the degree, these families have an asymptotically large number of vertices as the diameter increases. In some cases, the results obtained are shown to be optimal.

[1]  M. A. Fiol,et al.  New Moore-Like Bounds and Some Optimal Families of Abelian Cayley Mixed Graphs , 2020, Annals of Combinatorics.

[2]  Miguel Angel Fiol.  On congruence in Zn and the dimension of a multidimensional circulant , 1995, Discret. Math..

[3]  Miquel Àngel Fiol Mora,et al.  The Diameter of undirected graphs associated to plane tessellations , 1985 .

[4]  Jozef Širáň,et al.  Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter , 2010 .

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

[6]  F. Aguiló,et al.  Abelian Cayley Digraphs with Asymptotically Large Order for Any Given Degree , 2015, Electron. J. Comb..

[7]  Mateo Valero,et al.  Discrete Optimization Problem in Local Networks and Data Alignment , 1987, IEEE Transactions on Computers.

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

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

[10]  Miguel Angel Fiol,et al.  On bipartite‐mixed graphs , 2016, J. Graph Theory.

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

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

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

[14]  Hebert Pérez-Rosés,et al.  A revised Moore bound for partially directed graphs , 2015 .

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

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

[17]  Miguel Angel Fiol,et al.  An improved upper bound for the order of mixed graphs , 2016, Discret. Math..

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

[19]  Hebert Pérez-Rosés,et al.  A Moore-like bound for mixed abelian Cayley graphs , 2016, Electron. Notes Discret. Math..

[20]  Hebert Pérez-Rosés,et al.  The Degree/Diameter Problem for mixed abelian Cayley graphs , 2017, Discret. Appl. Math..

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