The nowhere-zero eigenbasis problem for a graph
From MaRDI portal
Recommendations
Cites work
Cited in
(12)- Tight frame graphs arising as line graphs
- How to suppress dark states in quantum networks and bio-engineered structures
- Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
- Nowhere-zero eigenvectors of graphs
- Distinct eigenvalues are realizable with generic eigenvectors
- Graphs and their real eigenvectors
- Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
- Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
- A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
- Orthogonal symmetric matrices and joins of graphs
- Existence of a not necessarily symmetric matrix with given distinct eigenvalues and graph
- The liberation set in the inverse eigenvalue problem 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)