On Difference Cordial Labeling of Networks
D. Florence Isido1, V.M.Chitra2

1D. Florence Isido, Department of Mathematics, Loyola College, Chennai (Tamil Nadu), India.
2V.M.Chitra, Sriram Engineering College, Perumalpattu (Tamil Nadu), India.

Manuscript received on 01 May 2019 | Revised Manuscript received on 15 May 2019 | Manuscript published on 30 May 2019 | PP: 1127-1130 | Volume-8 Issue-7, May 2019 | Retrieval Number: G6340058719/19©BEIESP
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: LetG be a . Let be a function. For each edge assign the label , f is called a difference cordial labeling if f is one to one map and , where and denote the number of edges labeled with 1 and labeled not with 1 respectively. A graph with difference cordial labeling is called difference cordial graph. In this paper we investigate the difference cordial labeling of the butterfly network, benes network, path union of cycles and corona product of cycles with K1, K2 and K3.
Keyword: Micro-Grid (MG) Distributed-Generation, Proportional integral (PI), Slide Mode Controller (SMC).
Scope of the Article: Cryptography and Applied Mathematics.