Abstract
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 , 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 .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.