Skip to main content
Log in

New Moore-Like Bounds and Some Optimal Families of Abelian Cayley Mixed Graphs

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are Cayley graphs of abelian groups. Such groups can be constructed using a generalization to \(\mathbb {Z}^n\) of the concept of congruence in \(\mathbb {Z}\). Here we use this approach to present some families of mixed graphs, which, for every fixed value of the degree, have an asymptotically large number of vertices as the diameter increases. In some cases, the results obtained are shown to be optimal.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. F. Aguiló, M. A. Fiol, and S. Pérez, Abelian Cayley digraphs with asymptotically large order for any given degree, Electron. J. Combin.23 (2016), no. 2, #P2.19.

  2. D. Buset, M. El Amiri, G. Erskine, M. Miller, and H. Pérez-Rosés, A revised Moore bound for partially directed graphs, Discrete Math.339 (2016), no. 8, 2066–2069.

    Article  MathSciNet  Google Scholar 

  3. C. Dalfó, M. A. Fiol, and N. López, On bipartite mixed graphs, J. Graph Theory89 (2018) 386–394.

    Article  MathSciNet  Google Scholar 

  4. C. Dalfó, C. Huemer, and J. Salas, The degree/diameter problem in maximal planar bipartite graphs, Electron. J. Combin.23(1) (2016) #P1.60.

  5. R. Dougherty and V. Faber, The degree-diameter problem for several varieties of Cayley graphs I. The Abelian case, SIAM J. Discrete Math.17 (2004), no. 3, 478–519.

    Article  MathSciNet  Google Scholar 

  6. M. R. Fellows, P. Hell, and K. Seyffarth, Large planar graphs with given diameter and maximum degree, Discrete Appl. Math.61 (1995) 133–153.

    Article  MathSciNet  Google Scholar 

  7. M. A. Fiol, Congruences in \({\mathbb{Z}}^n\), finite Abelian groups and the Chinese remainder theorem, Discrete Math.67 (1987) 101–105.

    Article  MathSciNet  Google Scholar 

  8. M. A. Fiol, On congruence in \({\mathbb{Z}}^n\) and the dimension of a multidimensional circulant, Discrete Math.141 (1995), no. 1-3, 123–134.

    Article  MathSciNet  Google Scholar 

  9. M. A. Fiol, J. L. A. Yebra, I. Alegre, and M. Valero A discrete optimizaton problem in local networks and data alignment, IEEE Trans. Comput.C-36 (1987), no. 6, 702–713.

    Article  Google Scholar 

  10. N. López, H. Pérez-Rosés, and J. Pujolàs, A Moore-like bound for mixed Abelian Cayley graphs, Electron. Notes Discrete Math.54 (2016) 145–150.

    Article  Google Scholar 

  11. N. López, H. Pérez-Rosés, and J. Pujolàs, The degree/diameter problem for mixed Abelian Cayley graphs, Discrete Appl. Math.231 (2017) 190–197.

    Article  MathSciNet  Google Scholar 

  12. H. Machbeth, J. Šiagiová, J. Širáň, and T. Vetrík, Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter, J. Graph Theory64 (2009) 87–98.

    MathSciNet  MATH  Google Scholar 

  13. M. Miller, H. Pérez-Rosés, and J. Ryan, The maximum degree and diameter-bounded subgraph in the mesh, Discrete Appl. Math.160 (2012) 1782–1790.

    Article  MathSciNet  Google Scholar 

  14. M. Miller and J. Širáň, Moore graphs and beyond: A Survey of the Degree-Diameter Problem, Electron. J. Combin.20(2) (2013) #DS14v2.

  15. E. A. Monakhova, A survey on undirected circulant graphs, Discrete Math. Algorithms Appl.4 (1) (2012).

  16. P. Morillo and M. A. Fiol, El diámetro de ciertos digrafos circulantes de paso fijo (in Spanish), StochasticaX (1986), no. 3, 233–249.

    Google Scholar 

  17. M. Newman, Integral Matrices, Pure and Appl. Math. Series Vol. 45, Academic Press, New York, 1972.

  18. M. H. Nguyen and M. Miller, Moore bound for mixed networks, Discrete Math.308 (2008), no. 23, 5499–5503.

    Article  MathSciNet  Google Scholar 

  19. M. H. Nguyen, M. Miller, and J. Gimbert, On mixed Moore graphs, Discrete Math.307 (2007) 964–970.

    Article  MathSciNet  Google Scholar 

  20. J. Šiagiová and T. Vetrík, Large vertex-transitive and Cayley graphs with given degree and diameter, Electron. Notes Discrete Math.28 (2007) 365–369.

    Article  MathSciNet  Google Scholar 

  21. R. Stanton and D. Cowan, Note on a ‘square’ functional equation, SIAM Rev.12 (1970) 277–279.

    Article  MathSciNet  Google Scholar 

  22. E. A. Tischenko, Maximum size of a planar graph with given degree and even diameter, European J. Combin.33 (2012) 380–396.

    Article  MathSciNet  Google Scholar 

  23. T. Vetrík, Cayley graphs of given degree and diameters 3, 4 and 5, Discrete Math.313 (2013) 213–216.

    Article  MathSciNet  Google Scholar 

  24. C. K. Wong and D. Coppersmith, A combinatorial problem related to multimodule memory organizations, J. ACM21 (1974) 392–402.

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The first two authors have been partially supported by the project 2017SGR1087 of the Agency for the Management of University and Research Grants (AGAUR) of the Catalan Government, and by MICINN from the Spanish Government under project PGC2018-095471-B-I00. The first and the third authors have been supported in part by Grant MTM2017-86767-R of the Spanish Government.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to C. Dalfó.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The research of C. Dalfó has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant agreement no. 734922.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dalfó, C., Fiol, M.A. & López, N. New Moore-Like Bounds and Some Optimal Families of Abelian Cayley Mixed Graphs. Ann. Comb. 24, 405–424 (2020). https://doi.org/10.1007/s00026-020-00496-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-020-00496-2

Keywords

Mathematics Subject Classification

Navigation