%0 Journal Article
%T Pair mean cordial labeling of graphs
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Ponraj, R
%A Prabhu, S
%D 2022
%\ 06/01/2022
%V 54
%N 1
%P 1-10
%! Pair mean cordial labeling of graphs
%K Path
%K cycle
%K complete graph
%K Wheel
%K ladder
%K Comb
%K Star
%K Bistar
%K fan graph
%R 10.22059/jac.2022.87392
%X 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.
%U https://jac.ut.ac.ir/article_87392_1826c7cf2b60089d62aa5b172956101a.pdf