Structural characterization of Cayley graphs
Discrete Mathematics
2016-09-28 v1 Combinatorics
Abstract
We show that the directed labelled Cayley graphs coincide with the rooted deterministic vertex-transitive simple graphs. The Cayley graphs are also the strongly connected deterministic simple graphs of which all vertices have the same cycle language, or just the same elementary cycle language. Under the assumption of the axiom of choice, we characterize the Cayley graphs for all group subsets as the deterministic, co-deterministic, vertex-transitive simple graphs.
Keywords
Cite
@article{arxiv.1609.08272,
title = {Structural characterization of Cayley graphs},
author = {Didier Caucal},
journal= {arXiv preprint arXiv:1609.08272},
year = {2016}
}
Comments
25 pages, 13 figures