@ARTICLE{Susanti,
author = {Susanti, Y. and Puspitasari, Y. I. and Khotimah, H. and },
title = {On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs},
volume = {15},
number = {1},
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. },
URL = {http://ijmsi.ir/article-1-1121-en.html},
eprint = {http://ijmsi.ir/article-1-1121-en.pdf},
journal = {Iranian Journal of Mathematical Sciences and Informatics},
doi = {10.29252/ijmsi.15.1.1},
year = {2020}
}