Let G be an arbitrarily chosen finite simple graph. We write non-negative integers on the vertices of the graph such that for each vertex v in G, the number written on v is equal to the number of vertices adjacent to v where an even number is written. Prove that the number of ways to achieve this is a power of 2. combinatoricsgraph theorykomal