By establishing the connection between graph colouring and the solution of some equation systems in finite fields, we obtain some formulas to the number of solu
For a graph G of size ε≥1 and its edge-induced subgraphs H1 and H2 of size γ(1 < γ < ε), H1 is said to be obtained from H2 by an edge jump if there exist f