Wang, Xiaoling (2021) The Number of Matching Equivalent for the Union Graph of Vertices and Cycles. Applied Mathematics, 12 (06). pp. 471-476. ISSN 2152-7385
![[thumbnail of am_2021062315332707.pdf]](http://go7publish.com/style/images/fileicons/text.png)
Text
am_2021062315332707.pdf - Published Version
Download (229kB)
Official URL: https://doi.org/10.4236/am.2021.126032
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].
| Item Type: | Article |
|---|---|
| Subjects: | European Repository > Mathematical Science |
| Depositing User: | Managing Editor |
| Date Deposited: | 01 Dec 2022 05:05 |
| Last Modified: | 20 Sep 2023 05:52 |
| URI: | http://go7publish.com/id/eprint/601 |
Actions (login required)
- View Item