TY - JOUR ID - 81169 TI - $4$-total mean cordial labeling of special graphs JO - Journal of Algorithms and Computation JA - JAC LA - en SN - 2476-2776 AU - Ponraj, R AU - SUBBULAKSHMI, S AU - Somasundaram, S AD - Department of Mathematics Sri Parakalyani College Alwarkurichi -627 412, India AD - Sri Paramakalyani College Alwarkurichi-627412, Tamilnadu, India AD - Department of Mathematics Manonmaniam sundarnar university, Abishekapatti, Tirunelveli-627012, Tamilnadu, India Y1 - 2021 PY - 2021 VL - 53 IS - 1 SP - 13 EP - 22 DO - 10.22059/jac.2021.81169 N2 - Let $G$ be a graph. Let $f:V\left(G\right)\rightarrow \left\{0,1,2,\ldots,k-1\right\}$ be a function where $k\in \mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $f\left(uv\right)=\left\lceil \frac{f\left(u\right)+f\left(v\right)}{2}\right\rceil$. $f$ is called $k$-total mean cordial labeling of $G$ if $\left|t_{mf}\left(i\right)-t_{mf}\left(j\right) \right| \leq 1$, for all $i,j\in\left\{0, 1, \ldots, k-1\right\}$, where $t_{mf}\left(x\right)$ denotes the total number of vertices and edges labelled with $x$, $x\in\left\{0,1,2,\ldots,k-1\right\}$. A graph with admit a $k$-total mean cordial labeling is called $k$-total mean cordial graph. UR - https://jac.ut.ac.ir/article_81169.html L1 - https://jac.ut.ac.ir/article_81169_28389b60f46526921271f4681f287da6.pdf ER -