Number of Spanning Trees of Circulant Graphs C6n and their Applications | Science Publications

Journal of Mathematics and Statistics

S. N. Daoud¹ 

关键词: Spanning trees;    circulant graphs;    chebyshev polynomials;    kirchhoff matrix;   

DOI  :  10.3844/jmssp.2012.24.31

学科分类：社会科学、人文和艺术（综合）

来源: Science Publications

【 摘 要 】

Problem statement: The number of spanning trees of a graph G is usually denoted by τ(G). A circulant graph with n vertices and k jumps is C_n (a₁,

【 授权许可】

Unknown