Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue (Q289954)
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: Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue |
scientific article; zbMATH DE number 6588109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue |
scientific article; zbMATH DE number 6588109 |
Statements
Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue (English)
0 references
1 June 2016
0 references
signless Laplacian
0 references
least eigenvalue
0 references
unicyclic graph
0 references
pendant vertex
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.889580488204956
0 references
0.8642116785049438
0 references
0.8407856225967407
0 references
