The numbers of spanning trees of the cubic cycle CN3 and the quadruple cycle CN4
暂无分享,去创建一个
Abstract The numbers of spanning trees of the cubic cycle C n 3 and the quadruple cycle C n 4 are considered in this paper. Two recursive relations are obtained. When we use our approach to consider the square cycle C n 2 , the proof is simpler than the previous ones. Furthermore, we may deal with the general case with the aid of the ideas and techniques in this paper.
[1] Helmut Prodinger,et al. Spanning tree formulas and chebyshev polynomials , 1986, Graphs Comb..
[2] N. Biggs. Algebraic Graph Theory: COLOURING PROBLEMS , 1974 .
[3] B. Golden,et al. Counting Trees in a Certain Class of Graphs , 1975 .