Octagonal prime graceful labeling

Abstract

Let G be a graph with p vertices and q edges. Define a bijection f : V (G) → {1, 8, ..., p(3p - 2)} by f(vi) = i(3i - 2) for every i from 1 to p and define a 1 - 1 mapping fopgl ∗ : E(G) → set of natural number N such that f∗(uv) = |f(u) - f(v)| for all edges (uv) ∈ E(G).The induced function f is said to be octagonal prime graceful labeling if the gcin of each vertex of degree atleast 2 is one.

Keywords

• octagonal numbers,octagonal graceful labeling,octagonal graceful graph,octagonal prime graceful labeling