论文标题
矩形，厚圆柱和Moebius带网格图的2因子转移挖掘的结构
The Structure of the 2-factor Transfer Digraph Common for Rectangular, Thick Cylinder and Moebius Strip Grid Graphs
论文作者
论文摘要
In this paper, we prove that all but one of the components of the transfer digraph ${\cal D}^*_m$ needed for the enumeration of 2-factors in the rectangular, thick cylinder and Moebius strip grid graphs of the fixed width $m$ $(m \in N)$ are bipartite digraphs and that their orders could be expressed in term of binomial coefficients.此外，我们证明每个组件的顶点集由所有二进制$ m $ - 单词组成，在奇数甚至位置中，零数的差异是恒定的。
In this paper, we prove that all but one of the components of the transfer digraph ${\cal D}^*_m$ needed for the enumeration of 2-factors in the rectangular, thick cylinder and Moebius strip grid graphs of the fixed width $m$ $(m \in N)$ are bipartite digraphs and that their orders could be expressed in term of binomial coefficients. In addition, we prove that the set of vertices of each component consists of all the binary $m$-words for which the difference of numbers of zeros in odd and even positions is constant.
