TANG Baoxiang, REN Han. A Recursive Method for Perfect Matching Number Classified with Saturation of a Certain VertexJ. 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 VertexJ. Journal of South China Normal University (Natural Science Edition), 2019, 51(5): 110-114. DOI: 10.6054/j.jscnun.2019092
TANG Baoxiang, REN Han. A Recursive Method for Perfect Matching Number Classified with Saturation of a Certain VertexJ. 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 VertexJ. Journal of South China Normal University (Natural Science Edition), 2019, 51(5): 110-114. DOI: 10.6054/j.jscnun.2019092
A Recursive Method for Perfect Matching Number Classified with Saturation of a Certain Vertex
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.