摘要
图的完美匹配是指能够覆盖图中所有顶点且互不相交的边集.图的完美匹配的计数问题是图论的匹配理论研究中的一个重要研究课题.研究了若干个特殊四角系统的完美匹配的计数问题,并运用组合递推方法给出了这几个特殊四角系统的完美匹配数的计算显式表达式.
A perfect matching of a graph G is defined as a set of independent edges of G covering all vertices of G. Enumeration of perfect matchings of graphs is an important studied subject of the matching theory in graph theory. In present paper, explicit formulas for the number of the perfect matchings in some type polyominoes are deduced by recursive calculation.
出处
《闽江学院学报》
2008年第2期1-7,共7页
Journal of Minjiang University
基金
福建省教育厅科研资助项目(JB06184)和(JA07177)
