Classification of edge-transitive propeller graphs
Combinatorics
2016-01-05 v2
Abstract
In this paper, we introduce a family of tetravalent graphs called propeller graphs, denoted by . We then produce three infinite subfamilies and one finite subfamily of arc-transitive propeller graphs, and show that all such graphs are necessarily members of one of these four subfamilies, up to isomorphism. We close the paper with questions for further investigation, as well as a few conjectures.
Keywords
Cite
@article{arxiv.1510.08491,
title = {Classification of edge-transitive propeller graphs},
author = {Matthew C. Sterns},
journal= {arXiv preprint arXiv:1510.08491},
year = {2016}
}
Comments
29 pages, 3 tables, 1 figure. v2: Included citation of Li regarding arc-transitive circulants, added a few helpful definitions, revised proof of Lemma 2.6, and fixed some minor typos