NILAI KETAKTERATURAN TOTAL SISI DARI GRAF TANGGA (STAIR GRAPH)

Abstract

Abstract. The total edges labelling λ is called an edge irregular total k-labelling of a graph G if every two distinct edges u and v in G ωt(u)≠ωt(v). The total edge irregularity strength of G is the minimum positive integer k for which G has a total edge irregular k-labelling. There are not many graphs of which their total edge irregularity strengths are known. In this article, we investigate the total edge irregularity strength of Stair Graph tes(Stn) and union of m isomorphic Stair Graphs tes(mStn). Key Words: Total edge irregularity strength, Stair Graph (Stn).