Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
From MaRDI portal
Publication:2642409
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)
Recommendations
Cited in
(63)- 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
- On the coexistence of competing memes in the same social network
- Inverse source problem in a forced network
- An optimal control problem with state constraints in a spatio-temporal economic growth model on networks
- Green's function in partial subdivision networks
- A combinatorial expression for the group inverse of symmetric \(M\)-matrices
- Some properties of Laplacian eigenvectors
- The \(M\)-matrix inverse problem for singular and symmetric Jacobi matrices
- On the isoperimetric spectrum of graphs and its approximations
- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- Eigenvalues with respect to a weight for general boundary value problems on networks
- Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem
- Kirchhoff indexes of a network
- Minimum vertex covers and the spectrum of the normalized Laplacian on trees
- Quasiabelian landscapes of the traveling salesman problem are elementary
- Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
- On Hadamard diagonalizable graphs
- On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
- Analysis of a data matrix and a graph: metagenomic data and the phylogenetic tree
- Network navigation with non-Lèvy superdiffusive random walks
- Spectra of Laplacian matrices of weighted graphs: structural genericity properties
- Dirichlet problems on graphs with ends
- Random walks and flights over connected graphs and complex networks
- Applications of combinatorial matrix theory to Laplacian matrices of graphs
- Mysteries around the graph Laplacian eigenvalue 4
- Some geometric aspects of graphs and their eigenfunctions
- On the spectrum of the normalized graph Laplacian
- Minimum supports of eigenfunctions of graphs: a survey
- Green functions on product networks
- Spectrally optimized pointset configurations
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
- Symmetric matrices, signed graphs, and nodal domain theorems
- Graphs of given order and size and minimum algebraic connectivity
- Extremal Graph Realizations and Graph Laplacian Eigenvalues
- Bifurcations in Nagumo equations on graphs and Fiedler vectors
- Interlacing inequalities for eigenvalues of discrete Laplace operators
- The Kirchhoff indices of join networks
- Maximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary condition
- Quadratic embedding constants of graph joins
- Nodal decompositions of graphs
- Explicit construction of the eigenvectors and eigenvalues of the graph Laplacian on the Cayley tree
- scientific article; zbMATH DE number 3979631 (Why is no real title available?)
- Mixed Hegselmann-Krause dynamics
- scientific article; zbMATH DE number 4050157 (Why is no real title available?)
- Node-to-node pinning control of complex networks
- On sums of graph eigenvalues
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- Nodal domains of eigenvectors for 1-Laplacian on graphs
- A Fiedler center for graphs generalizing the characteristic set
- Leaders in multi-agent controllability under consensus algorithm and tree topology
- Algebraic connectivity and degree sequences of trees
- An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs
- Graph spectra as a systematic tool in computational biology
- The Kirchhoff indexes of some composite networks
- The rotational dimension of a graph
- A note on Fiedler vectors interpreted as graph realizations
- Schur reduction of trees and extremal entries of the Fiedler vector
- Trapping of continuous-time quantum walks on Erdős-Rényi graphs
- Random walks with long-range steps generated by functions of Laplacian matrices
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)
