arXiv:1402.3635 [math.CO]AbstractReferencesReviewsResources
Degree distributions for a class of Circulant graphs
Dongseok Kim, Young Soo Kwon, Jaeun Lee
Published 2014-02-15Version 1
We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group $\C{A}$. Using these characterizations, we find degree distribution polynomials for weak equivalence of some graphs including 1) circulant graphs of prime power order, 2) circulant graphs of order $4p$, 3) circulant graphs of square free order and 4) Cayley graphs of order $p$ or $2p$. As an application, we find an enumeration formula for the number of weak equivalence classes of circulant graphs of prime power order, order $4p$ and square free order and Cayley graphs of order $p$ or $2p$.
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2006.07677 [math.CO] (Published 2020-06-13)
Total Coloring for some classes of Circulant graphs
arXiv:1203.0707 [math.CO] (Published 2012-03-04)
Asymptotic Automorphism Groups of Circulant Graphs and Digraphs
On the eigenvalues of certain Cayley graphs and arrangement graphs