Pages that link to "Item:Q2642409"
From MaRDI portal
The following pages link to Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems (Q2642409):
Displayed 50 items.
- Leaders in multi-agent controllability under consensus algorithm and tree topology (Q360669) (← links)
- Dirichlet problems on graphs with ends (Q401057) (← links)
- On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes (Q424499) (← links)
- The Kirchhoff indexes of some composite networks (Q427881) (← links)
- Minimum vertex covers and the spectrum of the normalized Laplacian on trees (Q432729) (← links)
- Nodal domains of eigenvectors for 1-Laplacian on graphs (Q507213) (← links)
- On Hadamard diagonalizable graphs (Q551311) (← links)
- Trapping of continuous-time quantum walks on Erdős-Rényi graphs (Q647812) (← links)
- The \(M\)-matrix inverse problem for singular and symmetric Jacobi matrices (Q665931) (← links)
- Random walks and flights over connected graphs and complex networks (Q718283) (← links)
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs (Q724411) (← links)
- The Kirchhoff indices of join networks (Q765336) (← links)
- Analysis of a data matrix and a graph: metagenomic data and the phylogenetic tree (Q765971) (← links)
- Quasiabelian landscapes of the traveling salesman problem are elementary (Q834186) (← links)
- On the spectrum of the normalized graph Laplacian (Q924372) (← links)
- Algebraic connectivity and degree sequences of trees (Q959888) (← links)
- Kirchhoff indexes of a network (Q962118) (← links)
- On the isoperimetric spectrum of graphs and its approximations (Q974467) (← links)
- A note on Fiedler vectors interpreted as graph realizations (Q991473) (← links)
- Graph spectra as a systematic tool in computational biology (Q1026212) (← links)
- Nodal decompositions of graphs (Q1688867) (← links)
- Lower bounds for the first eigenvalue of the Steklov problem on graphs (Q1732794) (← links)
- Interlacing inequalities for eigenvalues of discrete Laplace operators (Q1941761) (← links)
- Mysteries around the graph Laplacian eigenvalue 4 (Q1947087) (← links)
- On sums of graph eigenvalues (Q2015086) (← links)
- Mixed Hegselmann-Krause dynamics (Q2069752) (← links)
- Network navigation with non-Lèvy superdiffusive random walks (Q2070526) (← links)
- Eigenvalues with respect to a weight for general boundary value problems on networks (Q2229483) (← links)
- A combinatorial expression for the group inverse of symmetric \(M\)-matrices (Q2236392) (← links)
- Random walk's correlation function for multi-objective NK landscapes and quadratic assignment problem (Q2279759) (← links)
- Explicit construction of the eigenvectors and eigenvalues of the graph Laplacian on the Cayley tree (Q2282779) (← links)
- A Fiedler center for graphs generalizing the characteristic set (Q2332427) (← links)
- Maximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary condition (Q2339430) (← links)
- Spectrally optimized pointset configurations (Q2402876) (← links)
- Schur reduction of trees and extremal entries of the Fiedler vector (Q2418995) (← links)
- Green functions on product networks (Q2420404) (← links)
- Graphs of given order and size and minimum algebraic connectivity (Q2427902) (← links)
- Quadratic embedding constants of graph joins (Q2676765) (← links)
- The rotational dimension of a graph (Q3168659) (← links)
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs (Q3463252) (← links)
- Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors (Q3637698) (← links)
- Spectra of Laplacian Matrices of Weighted Graphs: Structural Genericity Properties (Q4602783) (← links)
- Random walks with long-range steps generated by functions of Laplacian matrices (Q4964566) (← links)
- Green's function in partial subdivision networks (Q5205782) (← links)
- Node-to-node pinning control of complex networks (Q5251411) (← links)
- Inverse source problem in a forced network (Q5383307) (← links)
- Minimum supports of eigenfunctions of graphs: a survey (Q5888902) (← links)
- An explicit formula for differences between Laplacian-eigenvector components using coalesced graphs (Q5962285) (← links)
- Symmetric matrices, signed graphs, and nodal domain theorems (Q6039199) (← links)
- A perturbed averaging operator on finite graphs (Q6087874) (← links)