Some graph properties determined by edge zeta functions

Details Some graph properties determined by edge zeta functions Some graph properties determined by edge zeta functions

2007-08-14

arxiv.org/abs/0708.1923v1

Mathematics

Combinatorics

15 pages, 3 figures, 26 references

Scientific paper

Stark 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.

Affiliated with

Also associated with

No associations

Rating

Some graph properties determined by edge zeta functions 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 Some graph properties determined by edge zeta functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some graph properties determined by edge zeta functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-389733