Enumerations of Cayley graphs
Dongseok Kim, Jin Hwan Kim, Jaeun Lee, Dianjun Wang
Abstract
We characterize the equivalence and the weak equivalence of Cayley graphs for a finite group A. 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.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.