Odd-even graceful labeling of planar grid and prism graphs

摘要

A graph G with p vertices and q edges is said to be odd-even graceful graph, if there exist an injective function f :V(G) - {1, 3,5,..., 2q +1} such that induced function f* : E(G) - (2, 4,6, ..., 2q) defined by f* (uv) = vertical bar f(u) - f(v)vertical bar for every uv is an element of E(G) is a bijection. In this paper we proved that the planar grid and the prism admit odd-even graceful labeling.