International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 44 - Number 4 |
Year of Publication: 2012 |
Authors: J. Shiama |
10.5120/6253-8399 |
J. Shiama . Square Difference Labeling for Some Graphs. International Journal of Computer Applications. 44, 4 ( April 2012), 30-33. DOI=10.5120/6253-8399
Here I define a new labeling and a new graph called square difference labeling and the square difference graph. Let G be a (p, q) graph. G is said to be a square difference graph if there exists a bijection f: V(G) ?{ 0,1, …. , p-1} such that the induced function f* : E(G) ? N given by f*(uv) = | [f(u)]2 - [f(v)]2| for every uv ? E(G) are all distinct. A graph which admits square difference labeling is called square difference graph. In this paper I discussed the square difference labeling is admitted for some graphs like cycles, complete graphs, cycle cactus, ladder, lattice grids, wheels, quadrilateral snakes, the graph G = K2 + m K1.