The clique number and the smallest \(Q\)-eigenvalue of graphs (Q267202)
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 clique number and the smallest Q-eigenvalue of graphs |
scientific article; zbMATH DE number 6566509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The clique number and the smallest \(Q\)-eigenvalue of graphs |
scientific article; zbMATH DE number 6566509 |
Statements
The clique number and the smallest \(Q\)-eigenvalue of graphs (English)
0 references
8 April 2016
0 references
blow-up graphs
0 references
Laplacian
0 references
signless Laplacian
0 references
complete subgraphs
0 references
extremal problem
0 references
clique number
0 references
0 references
0 references
0.8436592221260071
0 references
0.8388826251029968
0 references
0.8241596817970276
0 references
0.8219189643859863
0 references
