On square sum graphs

• Carmina, K. A. ^[1] ; Sebastian, Reena ^[2]
  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. 32, Nº. 2, 2013, págs. 107-117
• Idioma: inglés
• DOI: 10.4067/S0716-09172013000200002
• 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 given by f * (uv) = (f (u))2 + (f (v))2 for every uv G E(G) is injective. In this paper we initiate a study on square sum graphs and prove that trees, unicyclic graphs, mCn,m > 1,cycle with a chord, the graph obtained by joining two copies of cycle Cn by a path Pk and the graph defined by path union of k copies of Cn, when the path Pn = P2 are square sum.

• 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 (2007), Kannur Univeristy, Kannur.
  • [3] F. Harary, Graph Theory, Addison-Wesley Pub. Comp., Reading, Massachusetts, 1969.
  • [4] J.A.Gallian, Graph labeling (Fifteenth edition), Electronic Journal of Combinatorics 19 (2012), `DS6