Some new 4-cordial graphs
Abstract
We discuss here 4-cordial labeling of some standard graph families. We prove that wheels, fans and friendship graphs are 4-cordial. We also prove that gear graph, double fan and helm admit 4-cordial labeling.
Copyright © 2014 K.K. Kanani, N.B. Rathod. 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
K. K. Kanani, N. B. Rathod, Some new 4-cordial graphs, J. Math. Comput. Sci. 4 (2014), 834–848.
BibTeX
@article{Kanani2014,
author = {Kanani, K.K. and Rathod, N.B.},
title = {Some new 4-cordial graphs},
journal = {J. Math. Comput. Sci.},
volume = {4},
year = {2014},
pages = {834--848},
doi = {}
}