Generalized characteristic polynomials of graph bundles

Simple item page
dc.creatorKim, Dongseok
dc.creatorKim, Hye Kyung
dc.creatorLee, Jaeun
dc.date2007-04-11
dc.date.accessioned2026-07-07T09:47:54Z
dc.date.available2026-07-07T09:47:54Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/0704.1431
dc.identifierhttp://arxiv.org/abs/0704.1431
dc.identifierLinear Algebra and its Applications 429 (2008) 688--697
dc.identifierdoi:10.1016/j.laa.2008.03.023
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/164015
dc.subjectCombinatorics
dc.subject05C50, 05C25, 15A15, 15A18
dc.titleGeneralized characteristic polynomials of graph bundles
dc.typetext

Files

Collections

arXiv