Some geometric aspects of graphs and their eigenfunctions

DOI10.1215/S0012-7094-93-06921-9zbMath0785.05066OpenAlexW1978238050MaRDI QIDQ1261117

Publication date: 16 September 1993

Published in: Duke Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/s0012-7094-93-06921-9

zbMATH Keywords

eigenvalues eigenfunctions Laplacian Faber-Krahn inequality fiber product Ramanujan graphs nodal regions

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)

Related Items

A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity ⋮ Minimum supports of eigenfunctions of graphs: a survey ⋮ The first Dirichlet eigenvalue of bicyclic graphs ⋮ Graph Laplacians, nodal domains, and hyperplane arrangements ⋮ Random Cayley graphs and expanders ⋮ Faber-Krahn type inequalities for trees ⋮ Minimum higher eigenvalues of Laplacians on graphs ⋮ On the spectral distribution of large weighted random regular graphs ⋮ Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines ⋮ Eigenfunctions of the edge-based Laplacian on a graph ⋮ An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian ⋮ Symmetric matrices, signed graphs, and nodal domain theorems ⋮ Payne-Polya-Weinberger, Hile-Protter and Yang's inequalities for Dirichlet Laplace eigenvalues on integer lattices ⋮ Nodal decompositions of graphs ⋮ Spectra of infinite graphs via freeness with amalgamation ⋮ On spectral radii of unraveled balls ⋮ Nodal domain theorems for \(p\)-Laplacians on signed graphs ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Minimal webs in Riemannian manifolds ⋮ Graphs of given order and size and minimum algebraic connectivity ⋮ Nodal domain count for the generalized graph \(p\)-Laplacian ⋮ On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes ⋮ Weighted join operators on directed trees ⋮ Expander graphs and their applications ⋮ Alon-Boppana-type bounds for weighted graphs ⋮ Monotonicity of Steklov eigenvalues on graphs and applications ⋮ Graphs whose positive semi-definite matrices have nullity at most two ⋮ Relative expanders or weakly relatively Ramanujan graphs. ⋮ The dual Cheeger constant and spectra of infinite graphs ⋮ Moments of the inverse participation ratio for the Laplacian on finite regular graphs ⋮ Formal Zeta function expansions and the frequency of Ramanujan graphs ⋮ On the order of regular graphs with fixed second largest eigenvalue ⋮ Discrete convolution-rearrangement inequalities and the Faber-Krahn inequality on regular trees ⋮ Explicit expanders of every degree and size ⋮ Sparse random graphs: Eigenvalues and eigenvectors ⋮ On eigenfunctions of Markov processes on trees ⋮ On eigenvalues of random complexes ⋮ Explicit Bounds from the Alon–Boppana Theorem ⋮ A lower bound for nodal count on discrete and metric graphs ⋮ Algebraic connectivity and degree sequences of trees ⋮ Sparse regular random graphs: spectral density and eigenvectors ⋮ On the isoperimetric spectrum of graphs and its approximations ⋮ On the extreme eigenvalues of regular graphs. ⋮ A lower bound on the spectral radius of the universal cover of a graph ⋮ Spectra of lifted Ramanujan graphs ⋮ Spectra of generalized compositions of graphs and hierarchical networks ⋮ Eigenvalues of graphs and a simple proof of a theorem of Greenberg ⋮ A strengthening and a multipartite generalization of the Alon-Boppana-Serre theorem ⋮ Discrete nodal domain theorems ⋮ Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue ⋮ Sheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture: with an Appendix by Warren Dicks ⋮ The non-backtracking spectrum of the universal cover of a graph ⋮ Explicit Near-Ramanujan Graphs of Every Degree ⋮ A new upper bound on the Cheeger number of a graph ⋮ A continuous analogue of the girth problem ⋮ Maximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary condition ⋮ The Faber-Krahn type isoperimetric inequalities for a graph ⋮ Spectral estimates for abelian Cayley graphs ⋮ Discrete Graphs – A Paradigm Model for Quantum Chaos ⋮ Faber–Krahn type inequality for unicyclic graphs ⋮ Fast Fourier transform for fitness landscapes

Cites Work

This page was built for publication: Some geometric aspects of graphs and their eigenfunctions