Group 3 S Cordial Remainder Labeling
A. Lourdusamy1, S. Jenifer Wency2, F. Patrick3
1A. Lourdusamy, Department of Mathematics, St. Xavier’s College, Palayamkottai, India.
2S. Jenifer Wency, Department of Mathematics, Manonmaiam Sundaranar University, Tirunelveli, India.
3F. Patrick, Department of Mathematics, St. Xavier’s College, Palayamkottai, India.
Manuscript received on November 12, 2019. | Revised Manuscript received on November 23, 2019. | Manuscript published on 30 November, 2019. | PP: 8276-8281 | Volume-8 Issue-4, November 2019. | Retrieval Number: D8953118419/2019©BEIESP | DOI: 10.35940/ijrte.D8953.118419
Open Access | Ethics and 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 (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Let G = (V(G),E(G)) be a graph and let 3 g :V(G)→S be a function. For each edge xy , assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x))≥ o(g( y)) or o(g( y)) ≥ o(g(x)) . The function g is called a group 3 S cordial remainder labeling of G if | vg(x)-vg(y) | ≤1 vg(x) vg(x) vg (y) ≤1and | (0) (1) | 1 g g eg e g , where v g v x denotes the number of vertices labeled with x and vg(i) g e i denotes the number of edges labeled with i (i= 0,1) . A graph G which admits a group 3 S cordial remainder labeling is called a group 3 S cordial remainder graph. In this paper, we introduce the concept of group 3 S cordial remainder labeling. We prove that some standard graphs admit a group 3 S cordial remainder labeling.
Keywords: Group 3 S Cordial Remainder Labeling, Group 3 S Cordial Remainder Graph, Path, Cycle.
Scope of the Article: Life Cycle Engineering.