On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

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.

Language:
English
Published:
Iranian Journal of Mathematical Sciences and Informatics, Volume:15 Issue: 1, May 2020
Pages:
1 to 13
https://www.magiran.com/p2127005