Some graph properties determined by edge zeta functions

Simple item page
dc.creatorStorm, Christopher K.
dc.date2007-08-14
dc.date.accessioned2026-07-07T08:23:38Z
dc.date.available2026-07-07T08:23:38Z
dc.descriptionStark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph properties which we can determine using the edge zeta function. In particular, the edge zeta function is enough to deduce the clique number, the number of Hamiltonian cycles, and whether a graph is perfect or chordal. Actually computing these properties takes exponential time. Finally, we present a new example illustrating that the Ihara zeta function cannot necessarily do the same.
dc.description15 pages, 3 figures, 26 references
dc.identifierhttps://arxiv.org/abs/0708.1923
dc.identifierhttp://arxiv.org/abs/0708.1923
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/136067
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.subject05C38 (Primary); 11M41 (Secondary)
dc.titleSome graph properties determined by edge zeta functions
dc.typetext

Files

Collections

arXiv