Square Sum Difference Product Prime Labeling of Some Tree Graphs

Main Article Content

Sunoj B S, Mathew Varkey T K

Abstract

Square sum difference product prime labeling of a graph is the labeling of the vertices with {0,1,2---------,p-1} and the edges with absolute difference of the sum of the squares of the labels of the incident vertices and product 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 difference product prime labeling. In this paper we investigate some tree graphs for square sum difference product prime labeling.

Article Details

How to Cite
, S. B. S. M. V. T. K. (2017). Square Sum Difference Product Prime Labeling of Some Tree Graphs. International Journal on Future Revolution in Computer Science &Amp; Communication Engineering, 3(11), 17–19. Retrieved from http://www.ijfrcsce.org/index.php/ijfrcsce/article/view/258
Section
Articles