The largest matching roots of unicyclic graphs with a fixed matching number (Q5193373)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7103159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The largest matching roots of unicyclic graphs with a fixed matching number |
scientific article; zbMATH DE number 7103159 |
Statements
The largest matching roots of unicyclic graphs with a fixed matching number (English)
0 references
10 September 2019
0 references
matching polynomial
0 references
largest matching root
0 references
matching number
0 references
unicyclic graph
0 references
0.8904048204421997
0 references
0.8746611475944519
0 references
0.8412073850631714
0 references
0.8399459719657898
0 references
0.8254362940788269
0 references
