In this paper, we introduce a new graph labeling called pair mean cordial labeling of graphs. Also, we investigate the pair mean cordiality of some graphs like path, cycle, complete graph, star, wheel, ladder, and comb.
Ponraj, R., & Prabhu, S. (2022). Pair mean cordial labeling of graphs. Journal of Algorithms and Computation, 54(1), 1-10. doi: 10.22059/jac.2022.87392
MLA
R Ponraj; S Prabhu. "Pair mean cordial labeling of graphs". Journal of Algorithms and Computation, 54, 1, 2022, 1-10. doi: 10.22059/jac.2022.87392
HARVARD
Ponraj, R., Prabhu, S. (2022). 'Pair mean cordial labeling of graphs', Journal of Algorithms and Computation, 54(1), pp. 1-10. doi: 10.22059/jac.2022.87392
VANCOUVER
Ponraj, R., Prabhu, S. Pair mean cordial labeling of graphs. Journal of Algorithms and Computation, 2022; 54(1): 1-10. doi: 10.22059/jac.2022.87392
)