The Total Edge and Vertex Irregularity Strength of A nC_3-Snake
., Nurdin · Hasanuddin University Repository · 2013
The total edge(vertex) irregular $t$-labeling of graph $G=(V, E)$ is a function $f: V \\cup U \\to \\{1, 2, 3, \\cdots, t\\}$ such that the weight of all edges(vertex) of $G$ are distinct. The weight of edge $xy \\in E$ under a total $t$-labeling is the number labels of $xy$ and the end vertices of $xy$ and the weight of vertex $x \\in V$ under a total $t$-labeling is the number labels of $x$ and the labels of edges incidence with $x$. The total edge(vertex) irregularity strength of $G$ is the minimum positive natural number of $t$ such that $G$ have a total edge(vertex) irregular $t$-labeling. In this paper, we find the total edge(vertex) irregularity strength of triangular snake.