Author(s)

Xiaoling Wang

School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China.

For two graphs G and H, if G and H have the same matching polynomial, then G and H are said to be matching equivalent. We denote by δ (G), the number of the matching equivalent graphs of G. In this paper, we give δ (sK₁ ∪ t₁C₉ ∪ t₂C₁₅), which is a generation of the results of in [1].

Graph, Matching Polynomial, Matching Equivalence

Wang, X. (2021) The Number of Matching Equivalent for the Union Graph of Vertices and Cycles. Applied Mathematics, 12, 471-476. doi: 10.4236/am.2021.126032.