Nodal decompositions of graphs

DOI10.1016/j.laa.2017.11.003zbMath1377.05154OpenAlexW2766017215MaRDI QIDQ1688867

John C. Urschel

Publication date: 12 January 2018

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

Full work available at URL: https://doi.org/10.1016/j.laa.2017.11.003

zbMATH Keywords

nodal domainsgeneralized Laplacian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Measuring Segregation via Analysis on Graphs ⋮ Three conjectures of Ostrander on digraph Laplacian eigenvectors ⋮ A literature survey of matrix methods for data science ⋮ Morse theory for discrete magnetic operators and nodal count distribution for graphs ⋮ On Pleijel's nodal domain theorem for quantum graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenfunctions and nodal sets
• Some geometric aspects of graphs and their eigenfunctions
• On the generalization of the Courant nodal domain theorem
• Wave equations for graphs and the edge-based Laplacian
• Graph Laplacians, nodal domains, and hyperplane arrangements
• Interlacing eigenvalues and graphs
• Spectral bisection of graphs and connectedness
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• Remarks on courant's nodal line theorem
• A generalization of Courant's nodal domain theorem.
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• On Courant's nodal domain theorem
• Courant's Nodal Line Theorem and Its Discrete Counterparts
• On the Optimality of the Median Cut Spectral Bisection Graph Partitioning Method
• A Panoramic View of Riemannian Geometry
• A nodal domain property for the p-Laplacian
• Discrete nodal domain theorems

This page was built for publication: Nodal decompositions of graphs