Generalized characteristic polynomials of graph bundles
Generalized characteristic polynomials of graph bundles
复制标题
DOI：
10.1016/j.laa.2008.03.023
复制
发表时间：
2007-04
影响因子：
1.1
通讯作者：
Dongseok Kim;Hye Kyung Kim;Jaeun Lee
中科院分区：
文献类型：
--
作者：
Dongseok Kim;Hye Kyung Kim;Jaeun Lee
本文给出了图丛的广义特征多项式的计算公式。证明了图的生成树数是图的广义特征多项式的偏导数(在(0，1))。由于图的Bartholdi Zeta函数的倒数可以从图的广义特征多项式得到，因此可以用我们的计算公式来计算图丛的Bartholdi Zeta函数。
In this paper, we find computational formulae for generalized characteristic polynomials of graph bundles. We show that the number of spanning trees in a graph is the partial derivative (at (0,1)) of the generalized characteristic polynomial of the graph. Since the reciprocal of the Bartholdi zeta function of a graph can be derived from the generalized characteristic polynomial of a graph, consequently, the Bartholdi zeta function of a graph bundle can be computed by using our computational formulae.