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