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.
