不含整数2的2-系整数组成的可重集的计数公式

The formular for counting the number of adjoint equivalence graphs of 2-series integers reset except number 2

为了更好地研究图的组合性质,就特殊图类的伴随等价图的计数问题做了讨论.通过讨论由2-系整数组成且不含整数2的可重集的色等价图的计数问题得到伴随等价图的计数方法.给出了伴随等价图及其补图的色等价图的个数的计算公式.本文提供了一种图的伴随等价计数的新方法,此方法比传统方法更为简洁.

In order to study some combinatorial properties of a graph, we discuss the counting problem of the number of the adjoint equivalence graphs. By counting the number of repeated sets which composed by 2-series integers. In this paper, we give a combination formula for computing the number of the hromatic equivalence graphs of its complement graph. Here we provide a new method for counting the number of the adjoint equivalence graphs, and this is more concise than the traditional methods.