On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem
From MaRDI portal
Publication:2685391
DOI10.1016/j.laa.2023.01.005OpenAlexW4320473120MaRDI QIDQ2685391
Jorge Alencar, Leonardo Silva de Lima, Vladimir Nikiforov
Publication date: 21 February 2023
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.15314
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Max \(k\)-cut and the smallest eigenvalue
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
- Infinite families of \(Q\)-integral graphs
- Spectral bounds for the clique and independence numbers of graphs
- Commutativity and spectra of Hermitian matrices
- On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\)
- On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\)
- On ±1 eigenvectors of graphs
This page was built for publication: On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem
