International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 37 - Issue 4 |
Published: January 2012 |
Authors: J.Shiama |
![]() |
J.Shiama . Square Sum Labeling For Some Middle and Total Graphs. International Journal of Computer Applications. 37, 4 (January 2012), 6-8. DOI=10.5120/4594-6548
@article{ 10.5120/4594-6548, author = { J.Shiama }, title = { Square Sum Labeling For Some Middle and Total Graphs }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 37 }, number = { 4 }, pages = { 6-8 }, doi = { 10.5120/4594-6548 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A J.Shiama %T Square Sum Labeling For Some Middle and Total Graphs%T %J International Journal of Computer Applications %V 37 %N 4 %P 6-8 %R 10.5120/4594-6548 %I Foundation of Computer Science (FCS), NY, USA
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 Pn, cycle Cn and middle graph of path Pn , cycle Cn are discussed.