### Cordiality in the context of duplication in crown related graphs

#### Abstract

Let G = (V(G),E(G)) be a graph and let f : V(G) → {0,1} be a mapping from the set of vertices to {0,1} and for each edge uv ∈ E assign the label |f(u)− f(v)|. If the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labled with 0 and the number of edges labeled with 1 differ by at most 1, then f is called a cordial labeling. We discuss cordial labeling of graphs obtained from duplication of certain graph elements in crown related graphs.

**How to Cite this Article:**U.M. Prajapati, R.M. Gajjar, Cordiality in the context of duplication in crown related graphs, Journal of Mathematical and Computational Science, Vol 6, No 6 (2016), 1058-1073 Copyright © 2016 U.M. Prajapati, R.M. Gajjar. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

J. Math. Comput. Sci.

ISSN: 1927-5307

Editorial Office: jmcs@scik.org

Copyright ©2019 JMCS