Abstract

Let G(V,E) be a graph with p vertices and q edges. A(p,q) graph G(V,E) is said to be a square difference graph if there exists a bijection f:V(G)→{0,1,2,....,p-1} such that the induced function f*:E(G)→N, N is a natural number, given by f*(uv)=|[f(u)]2-[f(v)]2 | for every edges uv in G and are all distinct and the function f is a called Square difference labeling of the graph G. In this paper, we prove Pmυ Pn, Pm υ Cn,Pm υ Sn ,Pm υ (cnΘK1) ,(PmΘK1) υ Pn ,(PmΘK1) υ Cn,(PmΘ K1) υ Sn,(PmΘK1) υ Ln (PmΘ K1) υ (PnΘ K1),(PmΘ K1) υ (CnΘ K1) and (PmΘ K1) υ (LnΘK1) are the square difference graphs.

Keywords

References

[1] Ajitha. V, K.L. Princy, V. Lokesha, P.S. Ranjini, On square difference Graphs, International, J. Math. Combin, Vol.1, (2012), 31-40.
[2] J. A. Gallian, A dynamic survey of graph labeling, The Electronic journal of Combinatorics, 5, (2002), # DS6, 1-144.
[3] Harary, Graph Theory, Addison-Wesley, Reading Massachusetts, 1972.
[4] T. Tharmaraj and P.B. Sarasija, Square difference Labeling for certain Graphs, International Journal of Mathematical Archive, 4 (8), (2013), 183-186.
[5] T. Tharmaraj and P.B. Sarasija, Some Adjacent edge graceful graphs, Annals of Pure and Applied Mathematics, Vol.6, No.2, ( 2014), 160-169.