Symmetric matrices, signed graphs, and nodal domain theorems
From MaRDI portal
Publication:6039199
DOI10.1007/s00526-023-02479-6zbMath1512.05169arXiv2201.00198OpenAlexW4366688347WikidataQ123232963 ScholiaQ123232963MaRDI QIDQ6039199
Publication date: 4 May 2023
Published in: Calculus of Variations and Partial Differential Equations (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.00198
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nodal domains of eigenvectors for 1-Laplacian on graphs
- Discrete quantitative nodal theorem
- A lower bound for nodal count on discrete and metric graphs
- Nodal geometry of graphs on surfaces
- Graph partitioning by eigenvectors
- On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Signed graphs
- Eigenfunctions and nodal sets
- Some geometric aspects of graphs and their eigenfunctions
- A nodal domain theorem and a higher-order Cheeger inequality for the graph \(p\)-Laplacian
- A discrete nodal domain theorem for trees
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Interlacing eigenvalues and graphs
- A short proof of the planarity characterization of Colin de Verdière
- \(p\)-Laplace operators for oriented hypergraphs
- Magnetic-sparseness and Schrödinger operators on graphs
- Courant's nodal domain theorem for positivity preserving forms
- Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
- Nodal domain and eigenvalue multiplicity of graphs
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- On the notion of balance of a signed graph
- Graphs and their real eigenvectors
- Eigenvectors of acyclic matrices
- Courant's Nodal Line Theorem and Its Discrete Counterparts
- A nodal domain property for the p-Laplacian
- Curvature and Higher Order Buser Inequalities for the Graph Connection Laplacian
- Discrete nodal domain theorems
This page was built for publication: Symmetric matrices, signed graphs, and nodal domain theorems
