Abstract
Let Γ=(VΓ,EΓ) be a simple undirected graph with finite vertex set VΓ and edge set EΓ. A total n-labeling α:VΓ∪EΓ→{1,2,…,n} is called a total edge irregular labeling on Γ if for any two different edges xy and x′y′ in EΓ the numbers α(x)+α(xy)+α(y) and α(x′)+α(x′y′)+α(y′) are distinct. The smallest positive integer n such that Γ can be labeled by a total edge irregular labeling is called the total edge irregularity strength of the graph Γ. In this paper, we provide the total edge irregularity strength of some asymmetric graphs and some symmetric graphs, namely generalized arithmetic staircase graphs and generalized double-staircase graphs, as the generalized forms of some existing staircase graphs. Moreover, we give the construction of the corresponding total edge irregular labelings.
Funder
Department of Mathematics Faculty of Mathematics and Natural Sciences Universitas Gadjah Mada Indonesia
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On the 2-Token Graphs of Some Disjoint Union of Graphs;Malaysian Journal of Mathematical Sciences;2023-12-14