Maximizing the least <i>Q</i>-eigenvalue of a unicyclic graph with perfect matchings (Q5069203)
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 7505526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing the least <i>Q</i>-eigenvalue of a unicyclic graph with perfect matchings |
scientific article; zbMATH DE number 7505526 |
Statements
Maximizing the least <i>Q</i>-eigenvalue of a unicyclic graph with perfect matchings (English)
0 references
8 April 2022
0 references
signless Laplacian
0 references
least eigenvalue
0 references
unicyclic graph
0 references
upper bound
0 references
0 references
0 references
0 references
0 references
0 references
0.9160599
0 references
0.9116083
0 references
0.9093618
0 references
0.9005536
0 references
0.9005272
0 references
0.8995942
0 references
0.8965087
0 references
0.89420265
0 references
