Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems

From MaRDI portal
Revision as of 10:43, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2642409

DOI10.1007/978-3-540-73510-6zbMath1129.05001OpenAlexW2501990301WikidataQ56991167 ScholiaQ56991167MaRDI QIDQ2642409

Peter F. Stadler, Josef Leydold, 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




Related Items (54)

Minimum supports of eigenfunctions of graphs: a surveyQuasiabelian landscapes of the traveling salesman problem are elementaryThe rotational dimension of a graphAnomalous nodal count and singularities in the dispersion relation of honeycomb graphsLeaders in multi-agent controllability under consensus algorithm and tree topologySpectrally optimized pointset configurationsSymmetric matrices, signed graphs, and nodal domain theoremsQuadratic embedding constants of graph joinsSchur reduction of trees and extremal entries of the Fiedler vectorDirichlet problems on graphs with endsGreen functions on product networksNodal decompositions of graphsA perturbed averaging operator on finite graphsBifurcations in Nagumo equations on graphs and Fiedler vectorsOn the coexistence of competing memes in the same social networkInterlacing inequalities for eigenvalues of discrete Laplace operatorsGraphs of given order and size and minimum algebraic connectivityExtremal Graph Realizations and Graph Laplacian EigenvaluesOn nodal domains and higher-order Cheeger inequalities of finite reversible Markov processesSpectra of Laplacian Matrices of Weighted Graphs: Structural Genericity PropertiesA regularized projection immersed boundary method for smooth boundary forcesThe Kirchhoff indexes of some composite networksMysteries around the graph Laplacian eigenvalue 4Minimum vertex covers and the spectrum of the normalized Laplacian on treesTrapping of continuous-time quantum walks on Erdős-Rényi graphsOn the spectrum of the normalized graph LaplacianInverse source problem in a forced networkLower bounds for the first eigenvalue of the Steklov problem on graphsEigenvalues with respect to a weight for general boundary value problems on networksThe \(M\)-matrix inverse problem for singular and symmetric Jacobi matricesA combinatorial expression for the group inverse of symmetric \(M\)-matricesNodal domains of eigenvectors for 1-Laplacian on graphsAlgebraic connectivity and degree sequences of treesKirchhoff indexes of a networkOn Hadamard diagonalizable graphsOn the isoperimetric spectrum of graphs and its approximationsOn sums of graph eigenvaluesRandom walks and flights over connected graphs and complex networksA note on Fiedler vectors interpreted as graph realizationsRandom walk's correlation function for multi-objective NK landscapes and quadratic assignment problemCheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphsExplicit construction of the eigenvectors and eigenvalues of the graph Laplacian on the Cayley treeAn explicit formula for differences between Laplacian-eigenvector components using coalesced graphsGreen's function in partial subdivision networksRandom walks with long-range steps generated by functions of Laplacian matricesInexact Matching of Large and Sparse Graphs Using Laplacian EigenvectorsGraph spectra as a systematic tool in computational biologyThe Kirchhoff indices of join networksMixed Hegselmann-Krause dynamicsAnalysis of a data matrix and a graph: metagenomic data and the phylogenetic treeNetwork navigation with non-Lèvy superdiffusive random walksA Fiedler center for graphs generalizing the characteristic setNode-to-node pinning control of complex networksMaximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary condition







This page was built for publication: Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems