PAPER ID:IJIM/V.2(III)/164-167/26

AUTHOR: Sunoj B S and Mathew Varkey T K

TITLE :SQUARE SUM PRIME LABELING OF SOME TREE GRAPHS

ABSTRACT: Square sum prime labeling of a graph is the labeling of the vertices with {0,1,2——-,p-1} and the edges with  sum of the squares of the labels of the incident vertices. The greatest common incidence number of a vertex (gcin) of degree greater than one is defined as the greatest common divisor of the labels of the incident edges. If the gcin of each vertex of degree greater than one is one, then the graph admits square sum prime labeling. Here we identify some tree graphs for square sum prime labeling.

KEYWORDS: Graph labeling, square sum, greatest common incidence number, prime labeling.

click here to download Fulltext

click here to download Certificate (Author 1)

click here to download Certificate (Author 2)