Quotient Square Sum Cordial Labeling
T. M. Selvarajan1, Swapna Raveendran2
1T. M. Selvarajan, Department of Mathematics, Noorul Islam Centre for Higher Education, Kanyakumari (Tamil Nadu), India.
2Swapna Raveendran, Department of Mathematics, Noorul Islam Centre for Higher Education, Kanyakumari (Tamil Nadu), India.
Manuscript received on 16 July 2019 | Revised Manuscript received on 01 August 2019 | Manuscript Published on 10 August 2019 | PP: 138-142 | Volume-8 Issue-2S3 July 2019 | Retrieval Number: B10250782S319/2019©BEIESP | DOI: 10.35940/ijrte.B1025.0782S319
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 (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Let G = (V, E) be a simple graph and : V {1, 2, … | V |} be a bijection, for each edge uv assigned the label 1 if is odd and 0 if is even. is called quotient square sum cordial labeling if | (0) − (1)| ≤ 1, where (0) and (1) denote the number of edges labeled with 0 and labeled with 1 respectively. A graph which admits a quotient square sum cordial labeling is called quotient square sum cordial graph. In this paper path Pn, cycle Cn, star K1,n , friendship graph Fn , bistar Bn,n , C4 ∪ Pn ,Km,2 and Km,2 ∪ Pn are shown to be quotient square sum cordial labeling .
Keywords: Quotient Square Sum Cordial Labeling, Friendship Graph, Wheel Graph and Double Fan Graph.
Scope of the Article: Cryptography and Applied Mathematics