Volume : VI, Issue : IX, September - 2017

Square Sum Prime Labeling of Some Snake Graphs

Sunoj B S, Mathew Varkey T K

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 snake graphs for square sum prime labeling. 

Keywords :

Article: Download PDF   DOI : 10.36106/ijsr  

Cite This Article:

Sunoj B S, Mathew Varkey T K, Square Sum Prime Labeling of Some Snake Graphs, INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH : Volume-6 | Issue-9 | September-2017

Number of Downloads : 343

References :