摘要
In the paper, we give a necessary and sufficient condition of matching equivalence of two graphs with the maximum matching root less than or equal to 2.
In the paper, we give a necessary and sufficient condition of matching equivalence of two graphs with the maximum matching root less than or equal to 2.
作者
Haicheng Ma
Yinkui Li
Haicheng Ma;Yinkui Li(Department of Mathematics, Qinghai University for Nationalities, Xining, China)
