On the largest matching roots of graphs with a given number of pendent vertices (Q1727760)
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: On the largest matching roots of graphs with a given number of pendent vertices |
scientific article; zbMATH DE number 7027149
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the largest matching roots of graphs with a given number of pendent vertices |
scientific article; zbMATH DE number 7027149 |
Statements
On the largest matching roots of graphs with a given number of pendent vertices (English)
0 references
20 February 2019
0 references
matching polynomial
0 references
largest matching root
0 references
pendent vertex
0 references
extremal graph
0 references
0.93259853
0 references
0 references
0.91014105
0 references
0.9056095
0 references
0.90291476
0 references
0.8988192
0 references
0 references
0.8894982
0 references
0 references
