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 δ&...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 δ (sK<sub>1</sub> ∪ t<sub>1</sub>C<sub>9</sub> ∪ t<sub>2</sub>C<sub>15</sub>), which is a generation of the results of in <a href="#ref1">[1].展开更多
文摘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 δ (sK<sub>1</sub> ∪ t<sub>1</sub>C<sub>9</sub> ∪ t<sub>2</sub>C<sub>15</sub>), which is a generation of the results of in <a href="#ref1">[1].
