Enumerations of Cayley graphs

2006/09/16 by Dongseok Kim, Jin Hwan Kim, Kim, Dongseok +5
Mathematics · #05C30 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C30

paper · pdf · doi:10.48550/arxiv.math/0609462

10 pages

arxiv created 2006/09/16 · arxiv updated 2009/12/01

Abstract

We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group \CA. Using these characterizations, we find enumeration formulae of the equivalence classes and weak equivalence classes of Cayley graphs. As an application, we find the number of weak equivalence classes of circulant graphs.

Related

• Degree distributions for a class of Circulant graphs
• On the power graphs which are Cayley graphs of some groups
• Automorphisms and Enumeration of Maps of Cayley Graph of a Finite Group
• The planar Cayley graphs are effectively enumerable I: consistently planar graphs
• The planar Cayley graphs are effectively enumerable II