Square Sum Labeling of Class of Planar Graphs

• Sebastian, Reena ^[2] ; Germina, K. A. ^[1]
  1. [1] Central University of Kerala

     Central University of Kerala

     India

     
  2. [2] S. E. S. College.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 34, Nº. 1, 2015, págs. 55-68
• Idioma: inglés
• DOI: 10.4067/S0716-09172015000100005
• Enlaces
  • Texto completo
• Resumen

  • A (p, q) graph G is said to be square sum, if there exists a bijection f : V(G) → {0,1, 2,...,p — 1} such that the induced function f * : E(G)→ N defined by f * (uv) = (f (u))2 + (f (v))2, ∀ uv ∈ E(G) is injective. In this paper we proved that the planar graphs Plm,n,TBL(n,α,k,β) and higher order level joined planar grid admits square sum labeling. Also the square sum properties of several classes of graphs with many odd cycles are studied.

• Referencias bibliográficas
  • Citas [1] B. D. Acharya, Personal Communication, September, (2011).
  • [2] Ajitha V, Studies in Graph Theory-Labeling of Graphs, Ph. D. Thesis, Kannur Univeristy, Kannur, (2007).
  • [3] D. M. Burton, Elementary number theory, Second Edition, Wm. C. Brown Company publishers, (1980).
  • [4] Beineke, L. W. and Hegde, S. M. Strongly Multiplicative graphs, Discuss. Math. Graph Theory, 21, pp. 63-75, (2001).
  • [5] J. A. Gallian, A dynamic survey of graph labrling, The Electronic Journal of Combinatorics (DS6), (2005).
  • [6] Germina K. A. and Reena Sebastian, On square sum Graphs, communicated.
  • [7] F. Harary, Graph Theory, Addison-Wesley Pub. Comp., Reading, Massachusetts, (1969).
  • [8] Ersazig and A. Rosa, Magic valuation of finite graphs, Canad. Math. Bull., 13, pp. 451-461, (1970).
  • [9] K. Ramanjaneyulu, V. Ch. Venkaiah and Kishore Kothapalli, Antimagic labeling of class of planar graphs, Australian Journal of Combinatorics,...
  • [10] J. Baskar Babujee,planar graphs with maximum edge antimagic property, The Mathematics Education, 37 (4), pp. 194-198, (2003).