Nodal domain theorems for \(p\)-Laplacians on signed graphs
From MaRDI portal
Publication:6146940
DOI10.4171/jst/472arXiv2209.09080OpenAlexW4388978536MaRDI QIDQ6146940
Shiping Liu, Dong Zhang, Chuanyuan Ge
Publication date: 31 January 2024
Published in: Journal of Spectral Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.09080
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nodal count of graph eigenfunctions via magnetic perturbation
- Magnetic interpretation of the nodal defect on graphs
- Nodal domains of eigenvectors for 1-Laplacian on graphs
- Discrete quantitative nodal theorem
- A lower bound for nodal count on discrete and metric graphs
- On the isoperimetric spectrum of graphs and its approximations
- Handbook of applied analysis
- 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
- Variational methods for non-differentiable functionals and their applications to partial differential equations
- 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
- A short proof of the planarity characterization of Colin de Verdière
- Equiangular lines with a fixed angle
- \(p\)-Laplace operators for oriented hypergraphs
- The Lemmens-Seidel conjecture and forbidden subgraphs
- Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
- Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- Nodal domain and eigenvalue multiplicity of graphs
- On the notion of balance of a signed graph
- Nodal domain count for the generalized graph \(p\)-Laplacian
- Graphs and their real eigenvectors
- Spectrum of the 1-Laplacian and Cheeger's Constant on Graphs
- Optimization and nonsmooth analysis
- Eigenvectors of acyclic matrices
- Variational Methods
- Discrete nodal domain theorems
- Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
- Symmetric matrices, signed graphs, and nodal domain theorems
- Spherical two-distance sets and eigenvalues of signed graphs
- A modeling and computational study of the frustration index in signed networks
This page was built for publication: Nodal domain theorems for \(p\)-Laplacians on signed graphs