An edge irregular total [Formula: see text]-labeling on simple and undirected graph [Formula: see text] is a map [Formula: see text] such that for any different edge [Formula: see text] and [Formula: see text] their weights [Formula: see text] and [Formula: see text] are distinct. The minimum [Formula: see text] for which the graph [Formula: see text] has an edge irregular total [Formula: see text]-labeling is called the total edge irregularity strength of [Formula: see text] and is denoted by tes[Formula: see text]. In this paper, we determine the exact value of the total edge irregularity strength of families of ladder-related graphs, namely triangular ladder graphs, diagonal ladder graphs and circular triangular ladder graphs.