K - parity mean cordial labeling of graphs

S. Alagu, R. Ponraj, R. Kala

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.

Full Text: PDF

Published: 2021-05-18

How to Cite this Article:

S. Alagu, R. Ponraj, R. Kala, K - parity mean cordial labeling of graphs, Algebra Lett., 2021 (2021), Article ID 2

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.

Algebra Letters

ISSN 2051-5502

Editorial Office: office@scik.org

Copyright ©2021 SCIK Publishing Corporation