The numbers of spanning trees of the cubic cycle C3N and the quadruple cycle C4N

Discrete Mathematics

Volumn 169, Issue 1-3, 1997, Pages 293-298

  Yong, Xue rong ^a   Talip, Acenjian ^a  

^a XINJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041545021     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00092-1     Document Type: Article

References (6)

1. G. Baron, H. Prodinger, R.F. Tichy, F.T. Boesch and J.F. Wang, The number of spanning trees in the square of a cycle, Fibonacci Quart. (1985) 258-264.
2. F.T. Boesch and 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.
3. F.T. Boesch and H. Prodinger, Spanning tree formulas and Chebyshev polynomials, Graphs Combin. 2 (1986) 191-200.
4. N. Biggs, Algebraic Graph Theory (Cambridge Univ. Press, Cambridge, 1976).
5. D.J. Kleitman and B. Golden, Counting trees in a certain class of graphs, Amer. Math. Monthly 82 (1975) 40-44.
6. p, J. Xinjiang Univ. 11 (1994) 12-16.