3-equitable total labeling of graphs

Abstract

Motivated by the existing 3-equitable labeling of graphs, in this paper we introduce a new graph labeling called 3-equitable total labeling and we investigate the 3-equitable total labeling of several families of graphs such as $C_n$, $W_n$, $S{L}_n$, $S(K_{4,n})$ and $K_n^{(4)}$.