THE MATCHING EQUIVALENT CLASSES OF GRAPHS WITH THE MAXIMUM MATCHING ROOT LESS THAN 2

Hai Cheng MA

Journal of Systems Science and Mathematical Sciences ›› 2003, Vol. 23 ›› Issue (3) : 337-342.

PDF(313 KB)
中国科学院数学与系统科学研究院期刊网
PDF(313 KB)
Journal of Systems Science and Mathematical Sciences ›› 2003, Vol. 23 ›› Issue (3) : 337-342. DOI: 10.12341/jssms09695
论文

THE MATCHING EQUIVALENT CLASSES OF GRAPHS WITH THE MAXIMUM MATCHING ROOT LESS THAN 2

  • Hai Cheng MA
Author information +
History +

Abstract

The matching equivalent classes of graphs with the maximum matching root less than 2 and their complement graphs are characterized.

Key words

Matching polynomial / matching equivalent / equivalent bridge / foundamen- tally equivalent

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
Hai Cheng MA. THE MATCHING EQUIVALENT CLASSES OF GRAPHS WITH THE MAXIMUM MATCHING ROOT LESS THAN 2. Journal of Systems Science and Mathematical Sciences, 2003, 23(3): 337-342 https://doi.org/10.12341/jssms09695
PDF(313 KB)

103

Accesses

0

Citation

Detail
Sections
Recommended

/

〈 〉