Laplace eigenvalues of graphs---a survey

DOI10.1016/0012-365X(92)90288-QzbMATH Open0783.05073MaRDI QIDQ686298FDOQ686298

Authors: Bojan Mohar 

Publication date: 14 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1054729
• scientific article; zbMATH DE number 867649
• scientific article; zbMATH DE number 510844
• Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
• Eigenvalues of the Laplacian of a graph^∗

zbMATH Keywords

eigenvectorsLaplacianhypergraphsHamiltonicityLaplace eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65)

Cites Work

• Eigenvalues and expanders
• The eigenvalues of random symmetric matrices
• A domain monotonicity theorem for graphs and Hamiltonicity
• Title not available (Why is that?)
• Title not available (Why is that?)
• The nonexistence of certain generalized polygons
• Theory of monomer-dimer systems
• The distance spectrum of a tree
• On the Shannon capacity of a graph
• Title not available (Why is that?)
• Isoperimetric numbers of graphs
• Title not available (Why is that?)
• Maximum hitting time for random walks on graphs
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Title not available (Why is that?)
• Quasi-random graphs
• Ramanujan graphs
• Recent results in the theory of graph spectra
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• The Laplacian Spectrum of a Graph
• Graph partitioning by eigenvectors
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Laplacian eigenvalues and the maximum cut problem
• Quasi-random hypergraphs
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Small eigenvalues of Riemann surfaces and graphs
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• On the theoretical backgrounds of cluster analysis based on the eigenvalue problem of the association matrix
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Eigenvalues, diameter, and mean distance in graphs
• A new 5‐arc‐transitive cubic graph
• Optimal linear labelings and eigenvalues of graphs
• Quasi‐random classes of hypergraphs
• Title not available (Why is that?)
• Absolute algebraic connectivity of trees
• On the time taken by random walks on finite groups to visit every state
• Hitting times for random walks on vertex-transitive graphs
• Title not available (Why is that?)
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• Counting colorful multi-dimensional trees
• Graph complexity and the laplacian matrix in blocked experiments
• Title not available (Why is that?)
• Cohomological Aspects of Hypergraphs
• The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
• Bounds on the cover time
• On the cover time of random walks on graphs
• Node and edge relaxations of the max-cut problem
• Large eigenvalues of the laplacian
• On the optimality of block designs
• Title not available (Why is that?)
• Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• Coalescence, majorization, edge valuations and the laplacian spectra of graphs
• A projection technique for partitioning the nodes of a graph
• Title not available (Why is that?)
• Diameter, covering index, covering radius and eigenvalues
• Ordering trees by algebraic connectivity
• An edge version of the matrix-tree theorem and the wiener index
• Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A minimax problem for graphs and its relation to generalized doubly stochastic matrices
• Ramanujan graphs and Hecke operators
• The laplacian matrix of a graph: unimodular congruence
• Title not available (Why is that?)
• Title not available (Why is that?)
• The cover time of a regular expander is O(n log n)
• Bounds on expected hitting times for a random walk on a connected graph

Cited In (81)

• Ordering trees with algebraic connectivity and diameter
• Upper bound for the non-maximal eigenvalues of irreducible nonnegative matrices
• Laplacian matrices of product graphs: applications in structural mechanics
• The property of maximal eigenvectors of trees
• Bounds on graph eigenvalues. I
• Computing the permanent of the Laplacian matrices of nonbipartite graphs
• Diffusion bank networks and capital flows
• Title not available (Why is that?)
• On the Laplacian eigenvalues of a graph and Laplacian energy
• On Hadamard diagonalizable graphs
• Completion of Laplacian integral graphs via edge addition
• A divide-and-conquer bound for aggregate's quality and algebraic connectivity
• Complex networks: structure and dynamics
• Ordering trees by their Laplacian spectral radii
• Ordering trees by the Laplacian coefficients
• Bipartiteness and the least eigenvalue of signless Laplacian of graphs
• Most Laplacian eigenvalues of a tree are small
• Lexicographic polynomials of graphs and their spectra
• Eigenvalues of Cayley graphs
• Spectral properties of unimodular lattice triangulations
• On graphs with a single large Laplacian eigenvalue
• Adjacency and Laplacian spectra of variants of neighborhood corona of graphs constrained by vertex subsets
• The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
• On trees with exactly one characteristic element
• Cut-off for large sums of graphs
• Graph characteristics from the heat kernel trace
• On graphs with algebraic connectivity equal to minimum edge density
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• Schur reduction of trees and extremal entries of the Fiedler vector
• Old and new results on algebraic connectivity of graphs
• On the signless Laplacian spectral radius of irregular graphs
• Deconstructing the Gel'fand-Yaglom method and vacuum energy from a theory space
• Spectral band localization for Schrödinger operators on discrete periodic graphs
• The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network
• On minimum bisection and related partition problems in graphs with bounded tree width
• Path Laplacian operators and superdiffusive processes on graphs. I: One-dimensional case
• Multiplicity of integer roots of polynomials of graphs
• Lower bounds for the Laplacian spectral radius of graphs
• Laplacian eigenvalues and partition problems in hypergraphs
• Sign-changing diagonal perturbations of Laplacian matrices of graphs
• Graph-based point drift: graph centrality on the registration of point-sets
• On the spectra of nonsymmetric Laplacian matrices
• A survey of graph laplacians
• On edge-rupture degree of graphs
• Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers
• Laplacian integral graphs in \(S(a, b)\)
• Cut ratios and Laplacian eigenvalues
• A characterization of spectral integral variation in two places for Laplacian matrices
• Laplacian distribution and domination
• Domination number and Laplacian eigenvalue distribution
• Web document clustering using hyperlink structures
• Critical point theory to isotropic discrete boundary value problems on weighted finite graphs
• STUDY OF SOME GRAPHICAL PARAMETERS OF SOME GRAPH STRUCTURE
• Schrödinger operators on periodic discrete graphs
• Spectra of graphs resulting from various graph operations and products: a survey
• On the adjoint of a matrix associated with trees
• A probabilistic approach to case-based inference
• Commute times for a directed graph using an asymmetric Laplacian
• On a conjecture on a Laplacian matrix with distinct integral spectrum
• Partial characterization of graphs having a single large Laplacian eigenvalue
• Laplace spectra of orgraphs and their applications
• Scaling laws for diffusion on (trans)fractal scale-free networks
• Laplacian spectral characterization of disjoint union of paths and cycles
• The Normalized Laplacian Spectrum of Folded Hypercube with Applications
• Graph-theory induced gravity and strongly-degenerate fermions in a self-consistent Einstein universe
• Spectrum of super commuting graphs of some finite groups
• Laplacian matrices and Alexandrov topologies of digraphs
• Laplacian spectra of cographs: a twin reduction perspective
• Free energy on a cycle graph and trigonometric deformation of heat kernel traces on odd spheres
• Spectra of graph operations based on splitting graph
• On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs
• Spectrum of Graphs over Rings: A Survey
• Extreme values of the Fiedler vector on trees
• Proof of a conjecture on distribution of Laplacian eigenvalues and diameter, and beyond
• Title not available (Why is that?)
• Discrete time heat kernel and UV modified propagators with dimensional deconstruction
• Laplacian eigenvalue distribution and diameter of graphs
• The algebraic connectivity of barbell graphs
• Combinatorial Fiedler theory and graph partition
• Matryoshka and disjoint cluster synchronization of networks
• Structural vulnerability and robustness in complex networks: different approaches and relationships between them

This page was built for publication: Laplace eigenvalues of graphs---a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686298)