The clique number and the smallest \(Q\)-eigenvalue of graphs (Q267202): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1508.01784 / rank | |||
Normal rank | |||
Revision as of 12:05, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The clique number and the smallest \(Q\)-eigenvalue of graphs |
scientific article |
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
