Call for Paper - September 2014 Edition
IJCA solicits original research papers for the September 2014 Edition. Last date of manuscript submission is August 20, 2014. Read More

Square Sum Labeling for Some Middle and Total Graphs

Print
PDF
International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 37 - Number 4
Year of Publication: 2012
Authors:
J.Shiama
10.5120/4594-6548

J.Shiama. Article: Square Sum Labeling For Some Middle and Total Graphs. International Journal of Computer Applications 37(4):6-8, January 2012. Full text available. BibTeX

@article{key:article,
	author = {J.Shiama},
	title = {Article: Square Sum Labeling For Some Middle and Total Graphs},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {37},
	number = {4},
	pages = {6-8},
	month = {January},
	note = {Full text available}
}

Abstract

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.

References

  • Danuta Michalak, On middle and total graphs with coarseness number equal 1, Spinger Verlag Graph Theory, Lagow (1981) proceedings, Berlin heidelberg, New York, Tokyo, pp. 139-150.
  • Frank Harrary, Graph theory, Narosa Publishing House- (2001).
  • J A Gallian, A dynamic survey of graph labeling, The Electronics journal of Combinatories,17(2010) # DS6
  • Square sum labeling by K.A.Germina
  • D B West, Introduction to Graph Theory, Prentice-Hall, India,2001