科研之友
微信
新浪微博
Facebook
分享链接
摘要
A near-polygonal graph is a graph Gamma which has a set C of in-cycles for some positive integer m such that each 2-path of Gamma is contained in exactly one cycle in C. If in is the girth of Gamma, then the graph is called polygonal. We provide a construction of an infinite family of polygonal graphs of arbitrary even girth with 2-arc transitive automorphism groups, showing that there are infinitely many 2-arc transitive polygonal graphs of every girth.
- 出版日期2011-2
