Generalized characteristic polynomials of graph bundles

From MaRDI portal




Abstract: 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.









This page was built for publication: Generalized characteristic polynomials of graph bundles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932141)