Generalized characteristic polynomials of graph bundles

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1016/j.laa.2008.03.023

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Generalized characteristic polynomials of graph bundles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalized characteristic polynomials of graph bundles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized characteristic polynomials of graph bundles will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-673282

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.