Degree distributions for a class of Circulant graphs
Combinatorics
2014-02-18 v1
Abstract
We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group . 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 , 3) circulant graphs of square free order and 4) Cayley graphs of order or . As an application, we find an enumeration formula for the number of weak equivalence classes of circulant graphs of prime power order, order and square free order and Cayley graphs of order or .
Keywords
Cite
@article{arxiv.1402.3635,
title = {Degree distributions for a class of Circulant graphs},
author = {Dongseok Kim and Young Soo Kwon and Jaeun Lee},
journal= {arXiv preprint arXiv:1402.3635},
year = {2014}
}