• ANALYTIC MEAN PRIME LABELING OF SOME CYCLE RELATED GRAPHS
Abstract
Analytic mean prime labeling of a graph is the labeling of the vertices with {0, 1, 2,… …,p-1} and the edges with mean of the absolute difference of the squares of the labels of the incident vertices if square difference is even or mean of the absolute difference of the squares of the labels of the incident vertices and one if square difference is 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 analytic mean prime labeling. Here we identify some cycle related graphs for analytic mean prime labeling.
Keywords
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |