Laplace eigenvalues of graphs—a survey
- 1 November 1992
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 109 (1-3) , 171-183
- https://doi.org/10.1016/0012-365x(92)90288-q
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- Quasi‐random classes of hypergraphsRandom Structures & Algorithms, 1990
- Small eigenvalues of Riemann surfaces and graphsMathematische Zeitschrift, 1990
- Quasi‐random hypergraphsRandom Structures & Algorithms, 1990
- Hitting times for random walks on vertex-transitive graphsMathematical Proceedings of the Cambridge Philosophical Society, 1989
- Bounds on the cover timeJournal of Theoretical Probability, 1989
- Lower bounds for covering times for reversible Markov chains and random walks on graphsJournal of Theoretical Probability, 1989
- Eigenvalues and expandersCombinatorica, 1986
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985
- On the time taken by random walks on finite groups to visit every stateProbability Theory and Related Fields, 1983
- Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theoryJournal of Combinatorial Theory, Series B, 1981