摘要
Mizuno和Sato定义了有向图的Zeta函数(见Linear Algebra Appl.,2001,336:181-190),它可用来计算有向图中具有给定长度的所有圈的个数.给出了任意有向图的覆盖的Zeta函数的计算公式.作为推论,覆叠重数为2,3和4的任意有向图覆盖(正则或非正则)的Zeta函数被计算出来,同时也计算了Cayley有向图的Zeta函数.
Zeta functions of digraphs were introduced by Mizuno and Sato （Linear Algebra Appl., 2001, 336：181-190）. It can be used to compute the number of all cycles with a fixed length in a digraph. In this paper, the Zeta function of any digraph covering is formulated. As a by-product, the Zeta functions of any （regular or not） digraph coverings with folding number 2, 3 or 4 are obtained. In addition, the same work is done for a Cayley digraph.
出处
《数学年刊（A辑）》
CSCD
北大核心
2008年第2期143-150,共8页
Chinese Annals of Mathematics
基金
国家自然科学基金(No．10571005)
973计划(No．2004CB318000)资助的项目．
