Large Cayley digraphs and bipartite Cayley digraphs of odd diameters
From MaRDI portal
Publication:2400546
DOI10.1016/J.DISC.2017.02.005zbMATH Open1369.05099arXiv1603.06013OpenAlexW2304273858MaRDI QIDQ2400546FDOQ2400546
Authors: Marcel Abas, Tomáš Vetrík
Publication date: 29 August 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: Let be the largest number of vertices in a Cayley digraph of degree and diameter , and let be the largest order of a bipartite Cayley digraph for given and . For every degree and for every odd we construct Cayley digraphs of order and diameter at most , where , and bipartite Cayley digraphs of order and diameter at most , where . These constructions yield the bounds for odd and , and for odd and . Our constructions give the best currently known bounds on the orders of large Cayley digraphs and bipartite Cayley digraphs of given degree and odd diameter . In our proofs we use new techniques based on properties of group automorphisms of direct products of abelian groups.
Full work available at URL: https://arxiv.org/abs/1603.06013
Recommendations
Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
Cited In (6)
This page was built for publication: Large Cayley digraphs and bipartite Cayley digraphs of odd diameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400546)