Pair mean cordial labeling of graphs

نویسندگان
Prabhu, S ID 1
Ponraj, R ID 2

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

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

doi
10.22059/jac.2022.87392
چکیده

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.

کلیدواژه‌ها
Path, cycle, complete graph, Wheel, ladder, Comb, Star, Bistar, fan graph