Nodal domain count for the generalized graph p-Laplacian
- 9 December 2022
- journal article
- research article
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 64, 1-32
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Istituto Nazionale di Alta Matematica "Francesco Severi"
- INdAM GNCS
This publication has 25 references indexed in Scilit:
- Multi-class Transductive Learning Based on ℓ 1 Relaxations of Cheeger Cut and Mumford-Shah-Potts ModelJournal of Mathematical Imaging and Vision, 2013
- On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processesStochastic Processes and their Applications, 2012
- Nodal domain counts and the chromatic number of graphsJournal of Physics A: Mathematical and Theoretical, 2007
- Bounds for the largest -Laplacian eigenvalue for graphsDiscrete Mathematics, 2006
- Can One Count the Shape of a Drum?Physical Review Letters, 2006
- Resolving isospectral ‘drums’ by counting nodal domainsJournal of Physics A: General Physics, 2005
- On the Generalization of the Courant Nodal Domain TheoremJournal of Differential Equations, 2002
- Nodal Domains Statistics: A Criterion for Quantum ChaosPhysical Review Letters, 2002
- Perron–Frobenius type results and discrete versions of nodal domain theoremsLinear Algebra and its Applications, 1999
- Some geometric aspects of graphs and their eigenfunctionsDuke Mathematical Journal, 1993