无向循环图的支撑树数  

The Numbers of Spanning Trees in Undirected Circulant Graphs

作　　者：陈协彬[1] 

机构地区：[1]漳州师范学院数学系,漳州363000

出　　处：《漳州师范学院学报（自然科学版）》2000年第4期1-6,共6页Journal of ZhangZhou Teachers College（Natural Science)

基　　金：福建省自然科学基金

摘　　要：设，gcd， 是个无向循环图，是其支撑树数。令 , 其模大于的根为 。本文证明了这里 ，并给出了几个例子。Let and gcd Let be an undirected circulant graph and be the number of its spanning trees. Suppose that , all of its roots with modules greater than 1 are , . In this paper, it is proved that where ,and some examples are also given.

关 键 词：支撑树数 偶度无向循环图 渐近式 极限式 矩阵-树定理 正则图 

分 类 号：O157.5[理学—数学]