%0 Journal Article
%A Susanti, Y.
%A Puspitasari, Y. I.
%A Khotimah, H.
%T On Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
%J Iranian Journal of Mathematical Sciences and Informatics
%V 15
%N 1
%U http://ijmsi.ir/article-1-1121-en.html
%R 10.29252/ijmsi.15.1.1
%D 2020
%K Total edge irregularity strength, Staircase graphs, Double staircase graphs, Mirror-staircase graphs,
%X 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.
%> http://ijmsi.ir/article-1-1121-en.pdf
%P 1-13
%& 1
%!
%9 Research paper
%L A-10-2794-1
%+ Dept. of Mathematics Universitas Gadjah Mada
%G eng
%@ 1735-4463
%[ 2020