The matching polynomial of a regular graph (Q1343771)
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: The matching polynomial of a regular graph |
scientific article; zbMATH DE number 719447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The matching polynomial of a regular graph |
scientific article; zbMATH DE number 719447 |
Statements
The matching polynomial of a regular graph (English)
0 references
6 February 1995
0 references
The authors prove that from the matching polynomial of a regular graph \(G\) it is possible to determine the order, valency, girth and number of cycles of length equal to the girth for \(G\). They also exhibit many graphs which are determined, to within isomorphism, by their matching polynomials.
0 references
matching polynomial
0 references
regular graph
0 references
0.825709342956543
0 references
0.7911070585250854
0 references
0.785896897315979
0 references
0.7858966588973999
0 references
