Abstract
In 1989, Hashimoto introduced an edge zeta function of a finite graph, which is a generalization of the Ihara zeta function. The edge zeta function is the reciprocal of a polynomial in twice as many indeterminants as edges in the graph and can be computed via a determinant expression. 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. Finally, we present a new example illustrating that the Ihara zeta function cannot necessarily do the same.