4类图完美匹配数目的嵌套递推求法

The number of four types of graphs of perfect matchings nested recursive method for finding

    摘要
  • 摘要: 用划分,求和再递推的方法分别给出了图3-n3LC4, 3-nBC4, 3-nL4和1-nXC4的完美匹配数目的计算公式,所给出的方法可以计算出许多特殊图的所有完美匹配的数目. 并利用所得到的计算公式计算出了一类图的Hamilton圈的数目.

     

    Abstract: The counting formula of the perfect matching for graphs 3-n3LC4,3-nBC4, 3-nL4 and 1-nXC4 is made by applying differentiation, summation and re-recursion in this paper. By the method presented in this paper, the numbers of all perfect matchings of many particular graphs can be calculated. The number of Hamilton cycles of some graphs has been calculated.

     

    • HTML全文
    • 参考文献(1)
    • 相关文章
    • 施引文献
  • 资源附件(0)

/

返回文章
返回