Square Sum Labeling For Some Middle and Total Graphs
J. Shiama · International Journal of Computer Applications · 2012
A (p, q) graph G is said to be a square sum graph if there exist a bijection f: V(G)→{0,1,2,….p-1} such that the induced function f * :E(G) → N given by f * (u v) =[f * (u)] 2 +[f * (v)] 2 for every uv ∈ E(G) are all distinct.In this paper the square sum labeling of total graph of path P n , cycle C n and middle graph of path P n , cycle C n are discussed. GeneraTermsMiddle graph, Total graph of cycle C n and path P n are denoted by M(P ,n ), M(C ,n ) and T(P n ),T(C n ) respectively.