ABSTRACT
Numbers of the form 3n2-2n for all n β₯ 1 are called octagonal numbers. Let G be a graph with p vertices and q edges. Let f :V(G)β{0,1,2,β¦,ππ} where ππ is the ππ‘β octagonal number be an injective function. Define the function f *: E(G) β {1,8,β¦,ππ} such that f *(uv) = βf(u)-f(v)βfor all edges uv βE(G). If f *(E(G)) is a sequence of distinct consecutive octagonal numbers {π1,π2,β¦,ππ}, then the function f is said to be octagonal graceful labeling and the graph which admits such a labeling is called a octagonal graceful graph. In this paper, octagonal graceful labeling of some graphs is studied.
Support the magazine and subscribe to the content
This is premium stuff. Subscribe to read the entire article.