University Of Tehran Press Journal of Algorithms and Computation 2476-2776 52 2 2020 12 01 $4$-total mean cordial labeling in subdivision graphs 1 11 78640 10.22059/jac.2020.78640 EN R Ponraj Department of Mathematics Sri Parakalyani College Alwarkurichi -627 412, India S SUBBULAKSHMI Sri Paramakalyani College Alwarkurichi-627412, Tamilnadu, India S Somasundaram Department of Mathematics Manonmaniam sundarnar university, Abishekapatti, Tirunelveli-627012, Tamilnadu, India Journal Article 2020 11 21 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,2,\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. https://jac.ut.ac.ir/article_78640_417b0db101ba534580bcc1065d70cdd3.pdf