Square Difference Labeling of Bloom Graph

Abstract

A function f of a graph G(p,q) admits square difference labeling if there exists a bijection f:V(G)→{0,1,2,...,p-1} such that the induced function f^*:E(G)→N given by f^*(uv)=|(f(u))²-(f(v))²| ∀uv∈E(G) is distinct. A graph which admits square difference labeling is called square difference graph. The major thrust of this paper is that we have provided an algorithm to find the square difference labeling of bloom graph.