TY - JOUR T1 - On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs TT - JF - IJMSI JO - IJMSI VL - 15 IS - 1 UR - http://ijmsi.ir/article-1-1121-en.html Y1 - 2020 SP - 1 EP - 13 KW - Total edge irregularity strength KW - Staircase graphs KW - Double staircase graphs KW - Mirror-staircase graphs N2 - Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G has an edge irregular total k-labeling is called the total edge irregularity strength of graph G and denoted by tes(G). In this paper, we determine the exact value of total edge irregularity strength for staircase graphs, double staircase graphs and mirror-staircase graphs. M3 10.29252/ijmsi.15.1.1 ER -