A discrete nodal domain theorem for trees

DOI10.1016/S0024-3795(02)00451-2zbMath1012.05114MaRDI QIDQ1863531

Türker Bıyıkoğlu

Publication date: 11 March 2003

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

zbMATH Keywords

treegraph Laplaciansign graphdiscrete nodal domain theorem

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Related Items (13)

Minimum supports of eigenfunctions of graphs: a survey ⋮ Graph Laplacians, nodal domains, and hyperplane arrangements ⋮ Leaders in multi-agent controllability under consensus algorithm and tree topology ⋮ An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian ⋮ Symmetric matrices, signed graphs, and nodal domain theorems ⋮ Nodal domain theorems for \(p\)-Laplacians on signed graphs ⋮ Nodal domain count for the generalized graph \(p\)-Laplacian ⋮ On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes ⋮ Minimum vertex covers and the spectrum of the normalized Laplacian on trees ⋮ On eigenfunctions of Markov processes on trees ⋮ A lower bound for nodal count on discrete and metric graphs ⋮ Approximations by graphs and emergence of global structures ⋮ On the isoperimetric spectrum of graphs and its approximations

Cites Work

• Unnamed Item
• Permanental roots and the star degree of a graph
• On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
• Eigenvectors of acyclic matrices
• Discrete nodal domain theorems

This page was built for publication: A discrete nodal domain theorem for trees