一类循环图的计数
Enumeration of Some Circular Graphs
-
摘要: 讨论了4度循环图的结构。所有n阶4度非同构的连通循环图被分为两类:Ⅰ类和Ⅱ类。给出了计算Ⅰ类循环图的计算公式,改进了关于n阶4度非同构的循环图的计数公式。Abstract: The structures of circular graphs of degree 4 are discussed. All non-isomorphic connected circular graphs with order n and degree 4 are divided into two types:type Ⅰ and type Ⅱ. A formula calculating the number of type Ⅰ is given. The formula about enumeration of circular graphs of non-isomorphic with order n and degree 4 is improved.