Research ArticleOpen AccessGoogle Scholar indexed
The Number of Matching Equivalent for the Union Graph of Vertices and Cycles
School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China
- 1 School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China
Copy link · social · email
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 δ ( sK 1 ∪ t 1 C 9 ∪ t 2 C 15 ), which is a generation of the results of in [1] .
KeywordsGraphMatching PolynomialMatching Equivalence
- Ma, H.C. and Wang, X.L. (2006) Matching Equivalent Graph Class of Point-Circle Union Graph. Journal of Northeast Normal University (Natural Science Edition), 4, 36-40.
- Godsil, C.D. (1993) Algebraic Combinatorics. Chapman and Hall, New York, London.
- Ma, H.C. (2000) Matching Equivalence Classes of Two Types of Graphs. Journal of Mathematical Study, 2, 218-222.
- Ma, H.C. (2003) Matches the Matching Equivalence Class of Graphs Whose Maximum Root Is Less than 2. Journal of Systems Science and Mathematical Sciences, 3, 337-342.
- Ma, H.C. and Li, Y.K. (2016) The Matching Equivalence Graphs with the Maximam Matching Root Less than or Equal to 2. Applied Mathematics, 7, 920-926. https://doi.org/10.4236/am.2016.79082
- Guo, Z.Y. and Yu, Y.S. (1989) On the Matching Uniqueness of Two Kinds of Graphs. Mathematica Applicata, 2, 25-32.
- Ma, H.C. (2017) A Characterization of Graphs with Rank More than 5. Applied Mathematics, 8, 26-34. https://doi.org/10.4236/am.2017.81003
- Ma, H.C. (2017) The Energy and Operations of Graphs. Advances in Pure Mathematics, 7, 345-351. https://doi.org/10.4236/apm.2017.76021