Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
From MaRDI portal
Publication:2642409
DOI10.1007/978-3-540-73510-6zbMATH Open1129.05001OpenAlexW2501990301WikidataQ56991167 ScholiaQ56991167MaRDI QIDQ2642409FDOQ2642409
Authors: Josef Leydold, Peter F. Stadler, Türker Bıyıkoğlu 
Publication date: 16 August 2007
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73510-6
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Signed and weighted graphs (05C22) Structural characterization of families of graphs (05C75)
Cited In (63)
- Some properties of Laplacian eigenvectors
- Dirichlet problems on graphs with ends
- Bifurcations in Nagumo equations on graphs and Fiedler vectors
- Algebraic connectivity and degree sequences of trees
- Quasiabelian landscapes of the traveling salesman problem are elementary
- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- Minimum vertex covers and the spectrum of the normalized Laplacian on trees
- Extremal Graph Realizations and Graph Laplacian Eigenvalues
- A Fiedler center for graphs generalizing the characteristic set
- Some geometric aspects of graphs and their eigenfunctions
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- On Hadamard diagonalizable graphs
- Leaders in multi-agent controllability under consensus algorithm and tree topology
- A combinatorial expression for the group inverse of symmetric \(M\)-matrices
- On the isoperimetric spectrum of graphs and its approximations
- Eigenvalues with respect to a weight for general boundary value problems on networks
- On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
- Spectra of Laplacian matrices of weighted graphs: structural genericity properties
- Random walks and flights over connected graphs and complex networks
- On sums of graph eigenvalues
- A note on Fiedler vectors interpreted as graph realizations
- The \(M\)-matrix inverse problem for singular and symmetric Jacobi matrices
- Mysteries around the graph Laplacian eigenvalue 4
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
- The Kirchhoff indices of join networks
- Kirchhoff indexes of a network
- An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs
- Trapping of continuous-time quantum walks on Erdős-Rényi graphs
- Nodal decompositions of graphs
- Title not available (Why is that?)
- The rotational dimension of a graph
- On the spectrum of the normalized graph Laplacian
- Title not available (Why is that?)
- Schur reduction of trees and extremal entries of the Fiedler vector
- Random walks with long-range steps generated by functions of Laplacian matrices
- Graph spectra as a systematic tool in computational biology
- Green functions on product networks
- Network navigation with non-Lèvy superdiffusive random walks
- Spectrally optimized pointset configurations
- Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem
- Analysis of a data matrix and a graph: metagenomic data and the phylogenetic tree
- Node-to-node pinning control of complex networks
- Explicit construction of the eigenvectors and eigenvalues of the graph Laplacian on the Cayley tree
- Mixed Hegselmann-Krause dynamics
- Applications of combinatorial matrix theory to Laplacian matrices of graphs
- Symmetric matrices, signed graphs, and nodal domain theorems
- Interlacing inequalities for eigenvalues of discrete Laplace operators
- Nodal domains of eigenvectors for 1-Laplacian on graphs
- Quadratic embedding constants of graph joins
- Minimum supports of eigenfunctions of graphs: a survey
- Graphs of given order and size and minimum algebraic connectivity
- Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
- Maximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary condition
- The Kirchhoff indexes of some composite networks
- Green's function in partial subdivision networks
- On the coexistence of competing memes in the same social network
- An optimal control problem with state constraints in a spatio-temporal economic growth model on networks
- Locally supported, quasi-interpolatory bases for the approximation of functions on graphs
- A regularized projection immersed boundary method for smooth boundary forces
- A perturbed averaging operator on finite graphs
- Cycle-star motifs: network response to link modifications
- Random walks associated with symmetric \(M\)-matrices
- Inverse source problem in a forced network
This page was built for publication: Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642409)
