Geometric Mean Cordial Labeling of Transformation Graph of a Star Graph
K. Nagarajan1, K. Chitra Lakshmi2
1Dr. K. Nagarajan, Head and Associate Professor, Department of Mathematics, Sri S. Ramasamy Naidu Memorial College, Sattur (Tamil Nadu), India.
2K. Chitra Lakshmi, Assistant Professor, Department of Mathematics, V. V. Vanniaperumal College for Women, Virudhunagar (Tamil Nadu), India.
Manuscript received on 25 November 2019 | Revised Manuscript received on 19 December 2019 | Manuscript Published on 30 December 2019 | PP: 992-994 | Volume-9 Issue-1S4 December 2019 | Retrieval Number: A12121291S419/19©BEIESP | DOI: 10.35940/ijeat.A1212.1291S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: Let G = ( V, E ) be a graph and f be a mapping from V(G)  { 0, 1, 2 }. For each edge uv, assign the label  f (u) f (v) , f is called a geometric mean cordial labeling if | vf (i) − vf (j) | ≤ 1 and | ef (i) − e f (j) | ≤ 1,where vf (x) and ef (x) denote the number of vertices and edges labeled with x, x  { 0, 1, 2 } respectively. A graph with a geometric mean cordial labeling is called geometric mean cordial graph. In this paper, the geometric mean cordiality of transformation graph of star is discussed.
Keywords: Cordial Labeling, Cordial Graph, Geometric Mean Cordial Labeling, Geometric Mean Cordial Graph, Transformation Graph.
Scope of the Article: Cryptography and Applied Mathematics