Abstract

AbstractIn this paper, we are interested in the asymptotic enumeration of bipartite Cayley digraphs and Cayley graphs over abelian groups. Let be an abelian group and let be the automorphism of defined by , for every . A Cayley graph is said to have an automorphism group as small as possible if . In this paper, we show that, except for two infinite families, almost all bipartite Cayley graphs on abelian groups have automorphism group as small as possible. We also investigate the analogous question for bipartite Cayley digraphs. These results are used for the asymptotic enumeration of bipartite Cayley digraphs and graphs over abelian groups.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call