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.
Recommendations
Cited in
(9)- Classes of graphs which approximate the complete Euclidean graph
- On the theory of matching equivalent graphs and rook equivalent chessboards
- On the matching polynomial and its relation to the rook polynomial
- scientific article; zbMATH DE number 6493054 (Why is no real title available?)
- scientific article; zbMATH DE number 4031747 (Why is no real title available?)
- scientific article; zbMATH DE number 1279034 (Why is no real title available?)
- scientific article; zbMATH DE number 951843 (Why is no real title available?)
- On ordering of complements of graphs with respect to matching numbers
- The exactly divide ability of several matching polynomial of graphs and the matching equivalent graphs of \(T_{2,2,n}\)
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)