The nowhere-zero eigenbasis problem for a graph
From MaRDI portal
Publication:290677
DOI10.1016/J.LAA.2016.04.028zbMATH Open1386.05107OpenAlexW2383996974MaRDI QIDQ290677FDOQ290677
Authors: Keivan Hassani Monfared, Bryan L. Shader
Publication date: 3 June 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.04.028
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
Cited In (12)
- Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
- The liberation set in the inverse eigenvalue problem of a graph
- Distinct eigenvalues are realizable with generic eigenvectors
- Existence of a not necessarily symmetric matrix with given distinct eigenvalues and graph
- Graphs and their real eigenvectors
- Nowhere-zero eigenvectors of graphs
- Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
- Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
- Tight frame graphs arising as line graphs
- Orthogonal symmetric matrices and joins of graphs
- How to suppress dark states in quantum networks and bio-engineered structures
- A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
This page was built for publication: The nowhere-zero eigenbasis problem for a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290677)