A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth |
| |
| Authors: | Eric Swartz |
| |
| Institution: | Department of Mathematics, The Ohio State University, Columbus, OH 43210, USA |
| |
| 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. |
| |
| Keywords: | Polygonal graphs 2-arc transitive graphs Graph automorphisms |
| 本文献已被 ScienceDirect 等数据库收录！ |
