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.
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.
Cite this article
U. M. Prajapati, R. M. Gajjar, Cordiality in the context of duplication in crown related graphs, J. Math. Comput. Sci. 6 (2016), 1058–1073.
BibTeX
@article{Prajapati2016,
author = {Prajapati, U.M. and Gajjar, R.M.},
title = {Cordiality in the context of duplication in crown related graphs},
journal = {J. Math. Comput. Sci.},
volume = {6},
year = {2016},
pages = {1058--1073},
doi = {}
}