Let G be an even valence graph without loops. G is oriented in
such a way that at each vertex the number of incoming edges is the same as
that of outgoing edges.  For such a graph, we define an integer polynomial
P(x).  P(x) is positive and symmetric. Using this polynomial, we prove one
property of the Conway polynomial of a positive alternating knot.