The Number of Matching Equivalent for the Union Graph of Points and Cycles

WANG Xiao-ling

doi:10.13718/j.cnki.xdzk.2016.08.007

Journal of Southwest University Natural Science Edition

Search Advanced

Message Board

Dear readers, authors and reviewers,you can add a message on this page. We will reply to you as soon as possible!

Name
	Name cannot be empty!
E-mail
	Mailbox cannot be empty! Mailbox cannot be empty!
Telephone
	Mobile number cannot be empty! Please enter a valid mobile number!
Title

Content
Verification Code

PDF
Cite
Share

facebook

twitter

google

linkedin

2016 Volume 38 Issue 8

Article Contents

Previous Article Next Article

WANG Xiao-ling. The Number of Matching Equivalent for the Union Graph of Points and Cycles[J]. Journal of Southwest University Natural Science Edition, 2016, 38(8). doi: 10.13718/j.cnki.xdzk.2016.08.007

Citation:

WANG Xiao-ling. The Number of Matching Equivalent for the Union Graph of Points and Cycles[J]. Journal of Southwest University Natural Science Edition, 2016, 38(8). doi: 10.13718/j.cnki.xdzk.2016.08.007

The Number of Matching Equivalent for the Union Graph of Points and Cycles

WANG Xiao-ling

More Information

Abstract

For two graphs G and H ,if G and H have the same matching polynomial ,then G and H is 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 ∪ t1 C6 ∪ t2 C15 ) .
- graph；matching polynomial；matching equivalence,
References
Access History

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

Export Citation

PDF

XML

Article Metrics

Article views(686) PDF downloads(98) Cited by(0)

Access History