K - parity mean cordial labeling of graphs
Abstract
Cordial labeling was first introduced by I. Cahit in 1987 [1]. Consequently difference cordial, product cordial labeling, prime cordial, mean cordial labeling etc., were introduced and studied by R. Ponraj et. al. [4,7,8]. In this paper we introduce a new notion called ‘k-parity Mean Cordial Labeling of Graphs’ and we investigate its behavior for some standard graphs.
- Published
- 18 May 2021
- Volume
- 2021 (2021)
- License
- CC BY 3.0
Copyright © 2021 S. Alagu, R. Ponraj, R. Kala. 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
S. Alagu, R. Ponraj, R. Kala, K - parity mean cordial labeling of graphs, Algebra Lett. 2021 (2021), 2. https://doi.org/10.28919/al/5439
BibTeX
@article{Alagu2021,
author = {Alagu, S. and Ponraj, R. and Kala, R.},
title = {K - parity mean cordial labeling of graphs},
journal = {Algebra Lett.},
volume = {2021},
year = {2021},
pages = {2},
doi = {10.28919/al/5439}
}