Large Cayley digraphs and bipartite Cayley digraphs of odd diameters

From MaRDI portal
Publication:2400546




Abstract: Let Cd,k be the largest number of vertices in a Cayley digraph of degree d and diameter k, and let BCd,k be the largest order of a bipartite Cayley digraph for given d and k. For every degree dgeq2 and for every odd k we construct Cayley digraphs of order 2kleft(lfloorfracd2flooright)k and diameter at most k, where kge3, and bipartite Cayley digraphs of order 2(k1)left(lfloorfracd2flooright)k1 and diameter at most k, where kge5. These constructions yield the bounds Cd,kge2kleft(lfloorfracd2flooright)k for odd kge3 and dgefrac3k2k+1, and BCd,kge2(k1)left(lfloorfracd2flooright)k1 for odd kge5 and dgefrac3k1k1+1. 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 kge5. In our proofs we use new techniques based on properties of group automorphisms of direct products of abelian groups.









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)