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)
05C80: Random graphs (graph-theoretic aspects)
05C65: Hypergraphs
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
A survey of graph laplacians, On the adjoint of a matrix associated with trees, Multiplicity of integer roots of polynomials of graphs
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
