Total vertex irregularity strength of generalized prism graphs

Muhammad Imran, Ali Ahmad, Muhammad Kamran Siddiqui, Tariq Mehmood

Research output: Contribution to journalArticlepeer-review

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: (Figure presented.), 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 (Figure presented.).

Original languageEnglish
JournalJournal of Discrete Mathematical Sciences and Cryptography
DOIs
Publication statusAccepted/In press - 2021

Keywords

  • Generalized prism
  • Irregularity strength
  • Primary 05C78
  • Secondary 05C38
  • Total vertex irregularity strength
  • Vertex irregular total k-labeling

ASJC Scopus subject areas

  • Analysis
  • Algebra and Number Theory
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Total vertex irregularity strength of generalized prism graphs'. Together they form a unique fingerprint.

Cite this