Some general classes of comatching graphs (Q1092933)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some general classes of comatching graphs |
scientific article; zbMATH DE number 4021198
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some general classes of comatching graphs |
scientific article; zbMATH DE number 4021198 |
Statements
Some general classes of comatching graphs (English)
0 references
1987
0 references
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.
0 references
weight
0 references
chains
0 references
cycles
0 references
attaching graphs to other graphs
0 references
matching polynomial
0 references
comatching graphs
0 references
