TOTAL PRIME LABELING OF BARYCENTRIC SUBDIVISION OF CYCLEGRAPHS
S. Meena, A. Ezhil · Journal of Critical Reviews · 2020
Let G= (V,E) be a graph with p vertices and q edges. A bijectionf: VUE: { 1, 2, 3, .. (p + q )} is said to be total prime labeling if (i) for each edge e = u v, the labels assigned to u and v are relatively prime, (ii) for each vertex of degree at least two, the gcd (greatest common divisor) of the labels on the incident edges is one. A graph which admits total prime labeling is called total prime graph. In this paper we investigate the total prime labeling of Barycentric subdivision of Cycle graphs and also investigate the flower graph Fln