On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem (Q2685391)
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 graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem |
scientific article; zbMATH DE number 7655694
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem |
scientific article; zbMATH DE number 7655694 |
Statements
On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem (English)
0 references
21 February 2023
0 references
eigenvector
0 references
maximum \(k\)-cut problem
0 references
signless Laplacian
0 references
adjacency matrix
0 references
0 references
