Perron-Frobenius type results and discrete versions of nodal domain theorems
From MaRDI portal
Publication:1124888
DOI10.1016/S0024-3795(99)00090-7zbMath0938.15002WikidataQ126778559 ScholiaQ126778559MaRDI QIDQ1124888
Publication date: 29 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items
Discrete quantitative nodal theorem ⋮ Generalized modularity matrices ⋮ Minimum supports of eigenfunctions of graphs: a survey ⋮ Graph Laplacians, nodal domains, and hyperplane arrangements ⋮ Rugged and Elementary Landscapes ⋮ Graph homomorphisms and nodal domains ⋮ 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 ⋮ A lower bound for nodal count on discrete and metric graphs ⋮ On the isoperimetric spectrum of graphs and its approximations ⋮ Discrete nodal domain theorems ⋮ Fast Fourier transform for fitness landscapes
This page was built for publication: Perron-Frobenius type results and discrete versions of nodal domain theorems
