New Family of Parity Combination Cordial Labeling of Graph
A. Muthaiyan1, M. Kathiravan2
1A. Muthaiyan, Assistant Professor, Department of Mathematics, Government Arts and Science College, Veppanthattai, Perambalur, Affiliated to Bharathidasan university, Trichy, India.
2M. Kathiravan*, Assistant Professor, Department of Mathematics, Govt. Arts College, Ariyalur, Affiliated to Bharathidasan university, Trichy, India.
Manuscript received on January 12, 2020. | Revised Manuscript received on January 22, 2020. | Manuscript published on February 10, 2020. | PP: 2756-1762 | Volume-9 Issue-4, February 2020. | Retrieval Number: D2055029420/2020©BEIESP | DOI: 10.35940/ijitee.D2055.029420
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Let G be a (p, q) graph. Let f be an injective map from V(G) to {1, 2, …, p}. For each edge xy, assign the label y x or x y according as x > y or y > x. f is called a parity combination cordial labeling (PCC-labeling) if f is a one to one map and | ef (0) − ef (1) | 1 where ef (0) and ef (1) denote the number of edges labeled with an even number and odd number respectively. A graph with a parity combination cordial labeling is called a parity combination cordial graph (PCC-graph). In this paper we investigate the PCC- labeling of the graph G, It is obtained by identifying a vertex vk in G and a vertex of degree n in Hn, where G is a PCC graph with p vertices and q edges under f with f(vk ) = 1.
Keywords: Parity Combination Cordial Labeling, Parity Combination Cordial Graph, Identifying a Vertex and Helm Hn.
Scope of the Article: Graph Algorithms And Graph Drawing