Coverings, heat kernels and spanning trees

Electronic Journal of Combinatorics

Volumn 6, Issue 1, 1999, Pages

  Chung, Fan ^a   Yau, S T ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002267352     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. C. T. Benson, Minimal regular graphs of girth eight and twelve, Canad. J. Math. 18 (1996), 1091-1094.
2. N. Biggs, Algebraic Graph Theory, Cambridge University Press, 1993.
3. R. Brooks, The spectral geometry of k-regular graphs, Journal D'analyse Mathematrique, 57 (1991) 120-151.
4. J. Cheeger and S.-T. Yau, A lower bound for the heat kernel, Communications on Pure and Applied Mathematics XXXIV (1981), 465-480.
5. D. M. Cvetković, M. Doob and H. Sachs, Spectra of graphs, Academic Press, New York, 1980.
6. F. R. K. Chung and S.-T. Yau, A combinatorial trace formula, Tsing Hua Lectures on Geometry and Analysis, (ed. S.-T. Yau), International Press, Cambridge, Massachusetts, 1997, 107-116.
7. F. R. K. Chung, Spectral Graph Theory, CBMS Lecture Notes, 1997 , AMS Publication.
8. P. Erdos and H. Sachs, Reguläre Graphen gegenebener Teillenweite mit Minimaler Knotenzahl, Wiss. Z. Univ. Halle - Wittenberg, Math. Nat. R. 12 (1963), 251-258.
9. W. Feit and G. Higman, The non-existence of certain generalized polygons, J. Algebra 1 (1964), 114-131.
10. J. Friedman, On the second eigenvalues and random walks in random d-regular graphs, Combinatorica 11 (1991), 331-362.
11. A. K. Kelmans, On properties of the characteristic polynomial of a graph, Kibernetiku-Na Sluzbu Kommunizmu 4 Gosenergoizdat, Moscow, 1967.
12. C. D. Godsil and B. D. McKay, Feasibility conditions for the existence of walkregular graphs, Linear Algebra Appl., 30 (1980), 51-61.
13. F. Kirchhoff, Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird, Ann. Phys. chem. 72 (1847) 497-508.
14. B. D. McKay, Backtrack programming and the graph isomorphism problem, M. Sc. Thesis, University of Melbourne, 1976.
15. B. D. McKay, The expected eigenvalue distribution of a large regular graph, Linear Algebra and its Applications 40 (1981), 203-216.
16. B. D. McKay, Spanning trees in regular graphs, Europ. J. Combinatorics 4 (1983), 149-160.
17. Peter Sarnak, Some Applications of Modular Forms, Cambridge University Press, New York, 1990.
18. Richard M. Schoen and S.-T. Yau, Lectures on Di erential Geometry, International Press, Cambridge, Massachusetts, 1994.
19. R. R. Singleton, On minimal graphs of maximum even girth, J. Comb. Th 1 (1966), 306-322.