ABSTRACT
Numbers of the form for all n ≥ 1 are called pentagonal numbers. Let G be a graph with p vertices and q edges. Let f : V(G)→{0,1,2,…, where is the pentagonal number be an injective function. Define the function f *: E(G) → {1,5,…, such that f *(uv)=│f(u)-f(v)│for all edges uv E(G). If f *( E(G)) is a sequence of distinct consecutive pentagonal numbers { , ,…, }, then the function f is said to be pentagonal graceful labeling and the graph which admits such a labeling is called a pentagonal graceful graph. In this paper, pentagonal 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.
Login if you have purchased
