ABSTRACT
Numbers of the form n(n+1) are called oblong numbers. Let On be the nth oblong number. An oblong sum labeling of a graph G=(V,E) with p vertices and q edges is a one to one function f : V(G) {0,2,4,6,8… } that induces a bijection f*: E(G) {01, 02, 03, …0q} of the edges of G defined by f*(u,v)=f(u)+f(v) for all e=uv E(G) The graph that admits oblong sum labeling is called oblong sum graph. In this paper, oblong sum labeling of some special 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
