| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655996 | Journal of Combinatorial Theory, Series A | 2010 | 7 Pages |
Abstract
A near-polygonal graph is a graph Γ which has a set C of m-cycles for some positive integer m such that each 2-path of Γ is contained in exactly one cycle in C. If m is the girth of Γ then the graph is called polygonal. We provide a construction of an infinite family of polygonal graphs of arbitrary odd girth with 2-arc transitive automorphism groups.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
