Graphs and their real eigenvectors

DOI10.1080/03081087.2015.1025687MaRDI QIDQ2789408zbMATH OpenOpenAlexFDO

Authors Abolfazl Kouros Mohammadian

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

eigenvalue spectrumeigenvectorreal symmetric matrixtree

Mathematics Subject Classification ID

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

Recommendations

• Perron-Frobenius type results and discrete versions of nodal domain theorems
• Eigenvectors of Random Graphs: Nodal Domains
• The nowhere-zero eigenbasis problem for a graph
• Symmetric matrices, signed graphs, and nodal domain theorems
• Size of nodal domains of the eigenvectors of a G(n,p) graph

Cites work

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

Cited in

(9)

• Graph partitioning by eigenvectors
• A discrete nodal domain theorem for trees
• The nowhere-zero eigenbasis problem for a graph
• Partly zero eigenvectors
• Symmetric matrices, signed graphs, and nodal domain theorems
• Nodal domain theorems for p-Laplacians on signed graphs
• Curvature, diameter and signs of graphs
• Drawing graphs by eigenvectors: theory and practice
• A note on Fiedler vectors interpreted as graph realizations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789408)