On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\)
From MaRDI portal
Publication:2328100
DOI10.1016/j.dam.2018.12.030zbMath1437.05132arXiv1806.00072OpenAlexW2963440177MaRDI QIDQ2328100
Jean-Guy Caputo, I. Khames, Arnaud Knippel
Publication date: 9 October 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.00072
Related Items (4)
On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem ⋮ Spectra of chains connected to complete graphs ⋮ On graphs with adjacency and signless Laplacian matrices eigenvectors entries in \(\{-1,+1\}\) ⋮ Localized solutions of nonlinear network wave equations
Cites Work
- Unnamed Item
- Unnamed Item
- Spectral bounds for the clique and independence numbers of graphs
- Laplacian graph eigenvectors
- Laplacian matrices of graphs: A survey
- On trees with perfect matchings
- On ±1 eigenvectors of graphs
- On trees with Laplacian eigenvalue one
- Oscillations of networks: the role of soft nodes
- Periodic orbits in nonlinear wave equations on networks
This page was built for publication: On graph Laplacian eigenvectors with components in \(\{- 1, 0, 1 \}\)
