DEFINITION 12.1
A directed graph (digraph) is a pair
of:
a set
, whose elements are called vertices or nodes,
a set
of ordered pairs of vertices, called directed edges.
By definition, each element
of
is a pair
of elements
of
. let us call
(resp.
) the source (resp. the target)
of
.
Let
be a directed graph.
For each positive integer
, we let
to be the number of
admissible closed paths in
.
Then we put
We define Perron Frobeinus operator
to be
PROPOSITION 12.2
EXERCISE 12.1
Let
be a dinamical system of a finite set
. Is it possible to
define a directed graph
such that its zeta function
coincides with the zeta function of the dinamical system
?
(Compare the Perron Frobenius matrix
with
`the pull back matrix'
.)