Abstract
A total k-labeling φ : V ∪ E → {1, 2, 3,…, k} is called a vertex irregular total k-labeling, if wt(a) ≠ wt(b), for x ≠ y ∈V, The weight of a vertex is defined as: , where N(a) is the set of neighbors of a. The minimum value of k for a vertex irregular total k-labeling is called the total vertex irregularity strength of G, tvs(G) [7]. Recently, many authors are studying the two well-known modifications of irregularity strength of graphs, namely, the total edge irregularity strength and the total vertex irregularity strength of graphs. In this paper we study the total vertex irregularity strength of the generalized prism .
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call