@article {
author = {Ponraj, R and SUBBULAKSHMI, S and Somasundaram, S},
title = {$4$-total mean cordial labeling of special graphs},
journal = {Journal of Algorithms and Computation},
volume = {53},
number = {1},
pages = {13-22},
year = {2021},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2021.81169},
abstract = {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.},
keywords = {},
url = {https://jac.ut.ac.ir/article_81169.html},
eprint = {https://jac.ut.ac.ir/article_81169_28389b60f46526921271f4681f287da6.pdf}
}