Total vertex irregularity strength of generalized prism graphs. (18th August 2022)

• Record Type: Journal Article
• Authors: Imran, Muhammad; Ahmad, Ali; Siddiqui, Muhammad Kamran; Mehmood, Tariq
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 25:Number 6(2022)
• Page Start: 1855
• Page End: 1865
• Publication Date: 2022-08-18
• Subjects: Primary 05C78 -- Secondary 05C38; Irregularity strength -- Vertex irregular total k-labeling -- Total vertex irregularity strength -- Generalized prism; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2020.1848103
• Languages: English
• ISSNs: 0972-0529

Abstract

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 .