On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\)
From MaRDI portal
Publication:2229491
DOI10.1016/j.laa.2020.05.006zbMath1459.05156arXiv1909.11860OpenAlexW3024675617MaRDI QIDQ2229491
Leonardo Silva de Lima, Jorge Alencar
Publication date: 17 February 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.11860
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The smallest eigenvalue of the signless Laplacian
- Spectral bounds for the clique and independence numbers of graphs
- Laplacian eigenvalues and the maximum cut problem
- Commutativity and spectra of Hermitian matrices
- Properties of spectra of graphs and line graphs
- On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\)
- On ±1 eigenvectors of graphs
This page was built for publication: On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\)