唐保祥, 任韩. 按饱和顶点分类的完美匹配数的递推求法[J]. 华南师范大学学报（自然科学版）, 2019, 51(5): 110-114. doi: 10.6054/j.jscnun.2019092
引用本文: 唐保祥, 任韩. 按饱和顶点分类的完美匹配数的递推求法[J]. 华南师范大学学报（自然科学版）, 2019, 51(5): 110-114. doi: 10.6054/j.jscnun.2019092
shu
TANG Baoxiang, REN Han. A Recursive Method for Perfect Matching Number Classified with Saturation of a Certain Vertex[J]. Journal of South China Normal University (Natural Science Edition), 2019, 51(5): 110-114. doi: 10.6054/j.jscnun.2019092
Citation: TANG Baoxiang, REN Han. A Recursive Method for Perfect Matching Number Classified with Saturation of a Certain Vertex[J]. Journal of South China Normal University (Natural Science Edition), 2019, 51(5): 110-114. doi: 10.6054/j.jscnun.2019092
shu

按饱和顶点分类的完美匹配数的递推求法

A Recursive Method for Perfect Matching Number Classified with Saturation of a Certain Vertex

    摘要
  • 摘要: 构造了2类新图2-2nK5和2-nZ5，用嵌套递推的方法，得到了这2类新图的完美匹配数的2个递推关系式及其通解, 从而得到了这2类图的完美匹配数目的计算公式.

     

    Abstract: Two new graphs 2-2nK5 and 2-nZ5 are constructed. Using the nested recursive method, two recursive relations of the perfect matching numbers of graphs 2-2nK5 and 2-nZ5 are obtained, and then the two recursive general solutions are solved. Thus, the formula for calculating the perfect matching number of these two types of graphs is obtained.

     

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

/

返回文章
返回