AU - Susanti, Y.
AU - Puspitasari, Y. I.
AU - Khotimah, H.
TI - On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
PT - JOURNAL ARTICLE
TA - IJMSI
JN - IJMSI
VO - 15
VI - 1
IP - 1
4099 - http://ijmsi.ir/article-1-1121-en.html
4100 - http://ijmsi.ir/article-1-1121-en.pdf
SO - IJMSI 1
ABĀ - 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.
CP - IRAN
IN - Dept. of Mathematics Universitas Gadjah Mada
LG - eng
PB - IJMSI
PG - 1
PT - Research paper
YR - 2020