科研之友
微信
新浪微博
Facebook
分享链接
摘要
A near-polygonal graph is a graph Gamma which has a set C of m-cycles for some positive integer m such that each 2-path of Gamma is contained in exactly one cycle in C. If m is the girth of Gamma then the graph is called polygonal. We provide a construction for an infinite family of 2-arc transitive near-polygonal graphs of valency 10 and provide a method for determining the length m of special cycles in graphs in this family. This provides us with some new instances of polygonal graphs as well.
- 出版日期2012-12
