On graphs with eigenvectors in $\{1, -1, 0\}$ and the max $k$-cut problem

DOI10.1016/j.laa.2023.01.005zbMath1508.05099arXiv2211.15314MaRDI QIDQ6418716

Jorge Alencar, Leonardo Silva de Lima, Vladimir Nikiforov

Publication date: 25 November 2022

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

This page was built for publication: On graphs with eigenvectors in $\{1, -1, 0\}$ and the max $k$-cut problem