The number of spanning trees in circulant graphs

Discrete Mathematics

Volumn 223, Issue 1-3, 2000, Pages 337-350

  Zhang, Yuanping ^a,b   Yong, Xuerong ^a,c   Golin, Mordecai J ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b HUNAN NORMAL UNIVERSITY   (China)

^c XINJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242377377     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00414-8     Document Type: Article

References (14)

1. G. Baron, H. Prodinger, R.F. Tichy, F.T. Boesch, J.F. Wang, The number of spanning trees in the square of a cycle, Fibonacci Quart. 23.3 (1985) 258-264.
2. S. Bedrosian, The Fibonacci numbers via trigonometric expressions, J. Franklin Inst. 295 (1973) 175-177.
3. N. Biggs, Algebraic Graph Theory, 2nd Edition, Cambridge University Press, London, 1993.
4. F.T. Boesch, H. Prodinger, Spanning tree formulas and Chebyshev polynomials, Graph Combin. 2 (1986) 191-200.
5. F.T. Boesch, J.F. Wang, A conjecture on the number of spanning trees in the square of a cycle, in: Notes from New York Graph Theory Day V, New York Academy Sciences, New York, 1982, p. 16.
6. D. Cvetkovič, M. Doob, H. Sachs, Spectra of Graphs: Theory and Applications, 3rd Edition, Johann Ambrosius Barth, Heidelberg, 1995.
7. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
8. G. 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.
9. D.J. Kleitman, B. Golden, Counting trees in a certain class of graphs, Amer. Math. Mon. 82 (1975) 40-44.
10. R. Sedgewick, P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA, 1996.
11. Talip, X.R. Yong, The number of spanning trees of three special cycles, preprint, 1994.
12. 3, Discrete Math. 169 (1997) 293-298.
13. 2, J. Xinjiang Univ. 11 (1994) 12-16.
14. F.J. Zhang, X.R. Yong, Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs & graphs, Sci. China, Ser. A 43 (2) (1999) 264-271.