[1]Biggs N. Algebraic Graph Theory. Cambridge: Cambridge University Press, 1993
[2]Merris R. Laplacian matrices of graphs : a survey. Linear Algebra Appl, 1994, 197-198: 143-176
[3]Boesch F T, Prodinger H. Spanning tree formulas and Chebyshev polynomials. Graphs and Combin, 1986, 2: 191-200
[4]李晓明,黄振杰. 图中树的数目计算及其在网络可靠性中的作用. 哈尔滨:哈尔滨工业大学出版社,1993
[5]Yong X R, Talip, Acenjian. The numbers of spanning trees of the cubic cyc
le \$C\+\{\+3\}\-N\$ and the quadruple cycle \$C\+\{\+4\}\-N\$. Discrete Math, 1997, 169: 293-298
[6]Zhang F J, Yong X R. Asymptotic enumeration theorem for the numbers of span
ning trees and Eulerian trails in circulant digraphs & graphs. Sci China, Seri A, 1999, 43(2): 264-271
[7]Zhang Y P, Yong X R, Golin M J. The number of spanning trees in circulantgraphs. Discrete Math, 2000,223: 337-350
[8]邵嘉裕. 组合数学. 上海:同济大学出版社, 1991
[9]Lovasz L, Plummer M D. Matching Theory. Amsterdam: NorthHolland, 1986 |