Even Vertex Gracefulness of Fan Graph
A. Solairaju, P. Muruganantham · International Journal of Computer Applications · 2010
A graph is even vertex graceful Theorem 2.3: If n = 2 (mod 3), the fan graph F(nC 3 ) is even vertex graceful.Proof: The graph F(nC 3 ) is chosen with some arbitrary labeling of edges as in the following diagram.