Ayuda
Ir al contenido

Dialnet


Square Sum Labeling of Class of Planar Graphs

    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
  • Enlaces
  • 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.


Fundación Dialnet

Dialnet Plus

  • Más información sobre Dialnet Plus

Opciones de compartir

Opciones de entorno