Total edge irregularity strength of accordion graphs

An edge irregular total k‐labeling $\mathit{\phi }:V\cup E\to \{1,2,\dots ,k\}$ of a graph $G=(V,E)$ is a labeling of vertices and edges of G in such a way that for any different edges xy and $x^{\prime }{y}^{\prime }$ their weights $\mathit{\phi }(x)+\mathit{\phi }(xy)+\mathit{\phi }(y)$ and $\mathit{\phi }(x^{\prime })+\mathit{\phi }(x^{\prime }{y}^{\prime })+\mathit{\phi }(y^{\prime })$ are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total k‐labeling. We have determined the exact value of the total edge irregularity strength of accordion graphs.