Abstract: In this talk, I will introduce how to count the number of walks without backtracking on a graph. If one consider primes of a graph as closed walks that do not contain backtracking and are not a power of any other walks, one can define zeta-functions of a graph as an analog of Riemann-Zeta function. And this zeta-function has an explicit determinantal formula in term of the adjacency matrix of a graph.