Journal of Algorithms and Computation
Open Access

Pair mean cordial labeling of graphs

Authors

R Ponraj 1
S Prabhu 2

1 Department of Mathematics Sri Parakalyani College Alwarkurichi -627 412, India

2 Research Scholor, Reg.No: 21121232091003, Department of Mathematics, Sri Paramakalyani College, Alwarkurichi–627 412, Tamilnadu, India

https://doi.org/10.22059/jac.2022.87392
Abstract
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.

Keywords

path
cycle
complete graph
wheel
ladder
comb
star
bistar
fan graph
Journal of Algorithms and Computation
Volume 54, Issue 1
June 2022
Pages 1-10

Home

Guide for Authors

Submit Manuscript

Reviewers

Contact Us