TITLE:
The Number of Matching Equivalent for the Union Graph of Vertices and Cycles
AUTHORS:
Xiaoling Wang
KEYWORDS:
Graph, Matching Polynomial, Matching Equivalence
JOURNAL NAME:
Applied Mathematics,
Vol.12 No.6,
June
24,
2021
ABSTRACT: 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 δ(sK1 ∪ t1C9 ∪ t2C15), which is a generation of the results of in [1].