GODSIL C D, GUTMAN I. On the Theory of the Matching Polynomial [J]. Journal of Graph Theory, 1981, 5(2): 137-144. doi: 10.1002/jgt.3190050203
BONDY J A, MURTY U S R. Graph Theory [M]. New York: Springer-Verlag, 2008.
KUNZ H. Location of the Zeros of the Partition Function for Some Classical Lattice Systems [J]. Physis Letters A, 1970, 32(5): 311-312. doi: 10.1016/0375-9601(70)90520-7
HOSOYA H. Topological Index, a Newly Proposed Quantity Characterizing the Topological Nature of Structural Isomers of Saturated Hydrocarbons [J]. Bulletin of the Chemical Society of Japan, 1971, 44(9): 2332-2339. doi: 10.1246/bcsj.44.2332
FARRELL E J. An Introduction to Matching Polynomials [J]. Journal of Combinatorial Theory (Series B), 1979, 27(1): 75-86. doi: 10.1016/0095-8956(79)90070-4
JERRUM M. Two-Dimensional Monomer-Dimer Systems Are Computationally Intractable [J]. Journal of Statistical Physis, 1987, 48(1/2): 121-134.
DONG F M. A New Expression for Matching Polynomials [J]. Discrete Mathematics, 2012, 312(4): 803-807. doi: 10.1016/j.disc.2011.11.019
GUTMAN I, WAGNER S. The Matching Energy of a Graph [J]. Discrete Applied Mathematics, 2012, 160(15): 2177-2187. doi: 10.1016/j.dam.2012.06.001
唐保祥, 任韩. 2类图完美对集数的计算公式[J]. 西南师范大学学报(自然科学版), 2020, 45(10): 13-15.
刘寅, 王鼎. 完全图K2n的边传递循环覆盖[J]. 西南大学学报(自然科学版), 2021, 43(2): 90-94.
马海成. 匹配最大根小于2的图的匹配等价类[J]. 系统科学与数学, 2003, 23(3): 337-342. doi: 10.3969/j.issn.1000-0577.2003.03.007
马海成. 匹配最大根小于等于2的图的匹配等价[J]. 数学学报, 2006, 49(6): 1355-1360. doi: 10.3321/j.issn:0583-1431.2006.06.023
马海成. 两类图的匹配等价类[J]. 数学研究, 2000, 33(2): 218-222. doi: 10.3969/j.issn.1006-6837.2000.02.019
马海成. 点并路的匹配等价图类[J]. 青海师范大学学报(自然科学版), 2003, 19(1): 6-8, 13.
解承玲, 马海成. 两个点并路的匹配等价图类[J]. 山东大学学报(理学版), 2021, 56(1): 29-34.
马海成. K1In的匹配等价图类[J]. 兰州大学学报(自然科学版), 2005, 41(5): 127-130.