Large Cayley digraphs and bipartite Cayley digraphs of odd diameters
From MaRDI portal
Publication:2400546
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 597594 (Why is no real title available?)
- Approaching the mixed Moore bound for diameter two by Cayley graphs
- Cycle prefix digraphs for symmetric interconnection networks
- Large Cayley digraphs of given degree and diameter
- Which Faber-Moore-Chen digraphs are Cayley digraphs?
Cited in
(8)- Large bipartite Cayley graphs of given degree and diameter
- Large Cayley graphs of small diameter
- Abelian Cayley digraphs with asymptotically large order for any given degree
- scientific article; zbMATH DE number 784887 (Why is no real title available?)
- A note on partial Cayley graphs
- Large butterfly Cayley graphs and digraphs
- Large Cayley digraphs of given degree and diameter
- On bipartite Cayley graphs of small diameter
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)