Laplace eigenvalues of graphs---a survey
From MaRDI portal
Publication:686298
DOI10.1016/0012-365X(92)90288-QzbMath0783.05073MaRDI QIDQ686298
Publication date: 14 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)
Related Items
Web document clustering using hyperlink structures, Lexicographic polynomials of graphs and their spectra, STUDY OF SOME GRAPHICAL PARAMETERS OF SOME GRAPH STRUCTURE, Spectral properties of unimodular lattice triangulations, Upper bound for the non-maximal eigenvalues of irreducible nonnegative matrices, Eigenvalues of Cayley graphs, On minimum bisection and related partition problems in graphs with bounded tree width, Multiplicity of integer roots of polynomials of graphs, Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them, The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network, Bounds on graph eigenvalues. I, Path Laplacian operators and superdiffusive processes on graphs. I: One-dimensional case, On trees with exactly one characteristic element, Sign-changing diagonal perturbations of Laplacian matrices of graphs, The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory, Old and new results on algebraic connectivity of graphs, Laplacian integral graphs in \(S(a, b)\), Complex networks: structure and dynamics, Graph-based point drift: graph centrality on the registration of point-sets, On graphs with a single large Laplacian eigenvalue, Laplacian distribution and domination, Schur reduction of trees and extremal entries of the Fiedler vector, On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs, A survey of graph laplacians, On the adjoint of a matrix associated with trees, Proof of a conjecture on distribution of Laplacian eigenvalues and diameter, and beyond, Spectrum of Graphs over Rings: A Survey, On the signless Laplacian spectral radius of irregular graphs, Combinatorial Fiedler theory and graph partition, Deconstructing the Gel'fand-Yaglom method and vacuum energy from a theory space, The Normalized Laplacian Spectrum of Folded Hypercube with Applications, Laplacian matrices of product graphs: applications in structural mechanics, Bipartiteness and the least eigenvalue of signless Laplacian of graphs, Discrete time heat kernel and UV modified propagators with dimensional deconstruction, Domination number and Laplacian eigenvalue distribution, Laplacian spectra of cographs: a twin reduction perspective, Commute times for a directed graph using an asymmetric Laplacian, Free energy on a cycle graph and trigonometric deformation of heat kernel traces on odd spheres, On graphs with algebraic connectivity equal to minimum edge density, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, Most Laplacian eigenvalues of a tree are small, On edge-rupture degree of graphs, Computing the permanent of the Laplacian matrices of nonbipartite graphs, Diffusion bank networks and capital flows, Ordering trees with algebraic connectivity and diameter, Partial characterization of graphs having a single large Laplacian eigenvalue, Laplacian spectral characterization of disjoint union of paths and cycles, Lower bounds for the Laplacian spectral radius of graphs, Scaling laws for diffusion on (trans)fractal scale-free networks, On a Conjecture on a Laplacian Matrix with Distinct Integral Spectrum, GRAPH-THEORY INDUCED GRAVITY AND STRONGLY-DEGENERATE FERMIONS IN A SELF-CONSISTENT EINSTEIN UNIVERSE, Cut-off for large sums of graphs, Schrödinger operators on periodic discrete graphs, Ordering trees by their Laplacian spectral radii, Laplace spectra of orgraphs and their applications, On Hadamard diagonalizable graphs, A divide-and-conquer bound for aggregate's quality and algebraic connectivity, Completion of Laplacian integral graphs via edge addition, On the spectra of nonsymmetric Laplacian matrices, Graph characteristics from the heat kernel trace, The property of maximal eigenvectors of trees, Adjacency and Laplacian spectra of variants of neighborhood corona of graphs constrained by vertex subsets, Laplacian eigenvalues and partition problems in hypergraphs, Cut ratios and Laplacian eigenvalues, A characterization of spectral integral variation in two places for Laplacian matrices, Ordering trees by the Laplacian coefficients, Spectra of graphs resulting from various graph operations and products: a survey, Critical point theory to isotropic discrete boundary value problems on weighted finite graphs, Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers, A probabilistic approach to case-based inference, Spectral band localization for Schrödinger operators on discrete periodic graphs, Laplacian matrices and Alexandrov topologies of digraphs
Cites Work
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Small eigenvalues of Riemann surfaces and graphs
- The cover time of a regular expander is O(n log n)
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Bounds on expected hitting times for a random walk on a connected graph
- On the optimality of block designs
- Ramanujan graphs
- Eigenvalues and expanders
- Graph partitioning by eigenvectors
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- The eigenvalues of random symmetric matrices
- Diameter, covering index, covering radius and eigenvalues
- Eigenvalues, diameter, and mean distance in graphs
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality
- Optimal linear labelings and eigenvalues of graphs
- A domain monotonicity theorem for graphs and Hamiltonicity
- Counting colorful multi-dimensional trees
- Recent results in the theory of graph spectra
- Laplacian eigenvalues and the maximum cut problem
- Node and edge relaxations of the max-cut problem
- Bounds on the cover time
- On the cover time of random walks on graphs
- Lower bounds for covering times for reversible Markov chains and random walks on graphs
- A projection technique for partitioning the nodes of a graph
- The nonexistence of certain generalized polygons
- Theory of monomer-dimer systems
- Isoperimetric numbers of graphs
- Large eigenvalues of the laplacian
- Graph complexity and the laplacian matrix in blocked experiments
- An edge version of the matrix-tree theorem and the wiener index
- The Laplacian Spectrum of a Graph
- The distance spectrum of a tree
- Quasi-random hypergraphs
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Hitting times for random walks on vertex-transitive graphs
- On the time taken by random walks on finite groups to visit every state
- Quasi‐random classes of hypergraphs
- Maximum hitting time for random walks on graphs
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- Cohomological Aspects of Hypergraphs
- On the Shannon capacity of a graph
- On the theoretical backgrounds of cluster analysis based on the eigenvalue problem of the association matrix
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Absolute algebraic connectivity of trees
- A minimax problem for graphs and its relation to generalized doubly stochastic matrices
- Coalescence, majorization, edge valuations and the laplacian spectra of graphs
- Ramanujan graphs and Hecke operators
- The laplacian matrix of a graph: unimodular congruence
- Quasi-random graphs
- A new 5‐arc‐transitive cubic graph
- Ordering trees by algebraic connectivity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item