Some general classes of comatching graphs

From MaRDI portal





Some sufficient conditions are given for two graphs to have the same matching polynomial (comatching graphs). Several general classes of comatching graphs are given. Also, techniques are discussed for extending certain pairs of comatching graphs to larger pairs of comatching graphs.











This page was built for publication: Some general classes of comatching graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092933)