ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

MEAN SUM SQUARE PRIME LABELING OF SOME CYCLE RELATED GRAPHS

Journal: INTERNATIONAL JOURNAL OF ENGINEERING TECHNOLOGIES AND MANAGEMENT RESEARCH (Vol.4, No. 12)

Publication Date:

Authors : ;

Page : 21-27

Keywords : Graph Labeling; Sum Square; Greatest Common Incidence Number; Prime Labeling; Cycles.;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

Mean sum square prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the edges with mean of the square of the sum of the labels of the incident vertices or mean of the square of the sum of the labels of the incident vertices and one, depending on the sum is even or odd. 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 mean sum square prime labeling. Here we identify some cycle related graphs for mean sum square prime labeling.

Last modified: 2018-01-23 15:53:18