International Journal of Engineering, Science and Mathematics
  • Year: 2017
  • Volume: 6
  • Issue: 4

A note on square sum prime labeling

  • Author:
  • B.S. Sunoj1, T K Mathew Varkey2
  • Total Page Count: 6
  • Page Number: 90 to 95

1Assistant Professor, Department of Mathematics, Government Polytechnic College, Attingal, Kerala, India

2Assistant Professor, Department of Mathematics, T K M College of Engineering, Kollam, Kerala, India

Online published on 19 April, 2019.

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

Keywords

Graph labeling, Square sum, Greatest common incidence number, Prime labeling