On ±1 eigenvectors of graphs
From MaRDI portal
Publication:2958707
DOI10.26493/1855-3974.1021.c0azbMath1368.05097OpenAlexW2541940167MaRDI QIDQ2958707
Publication date: 3 February 2017
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1021.c0a
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
The non-negative spectrum of a digraph ⋮ On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem ⋮ On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\) ⋮ On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\)
This page was built for publication: On ±1 eigenvectors of graphs
