Graphs and their real eigenvectors

DOI10.1080/03081087.2015.1025687zbMath1331.05065OpenAlexW2019382034MaRDI QIDQ2789408

No author found.

Publication date: 29 February 2016

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2015.1025687

zbMATH Keywords

treeeigenvectoreigenvalue spectrumreal symmetric matrix

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Signed and weighted graphs (05C22)

Related Items (2)

Symmetric matrices, signed graphs, and nodal domain theorems ⋮ Nodal domain theorems for \(p\)-Laplacians on signed graphs

Cites Work

• Spectra of graphs
• A lower bound for nodal count on discrete and metric graphs
• On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
• A short proof of the planarity characterization of Colin de Verdière
• The nodal count {0,1,2,3,…} implies the graph is a tree
• Discrete nodal domain theorems

This page was built for publication: Graphs and their real eigenvectors