On inclusive distance vertex irregular labelings

Martin Bača, Andrea Semaničová-Feňovčíková, Slamin, Kiki Ariyanti

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


For a simple graph G, a vertex labeling f: V (G) → (1; 2....,k) is called a k-labeling. The weight of a vertex v, denoted by wtf (v) is the sum of all vertex labels of vertices in the closed neighborhood of the vertex v. A vertex k-labeling is defined to be an inclusive distance vertex irregular distance k-labeling of G if for every two different vertices u and v there is wtf (u) ≠ wtf (v). The minimum k for which the graph G has a vertex irregular distance k-labeling is called the inclusive distance vertex irregularity strength of G. In this paper we establish a lower bound of the inclusive distance vertex irregularity strength for any graph and determine the exact value of this parameter for several families of graphs.

Original languageEnglish
Pages (from-to)61-83
Number of pages23
JournalElectronic Journal of Graph Theory and Applications
Issue number1
Publication statusPublished - 1 Jan 2018


  • Inclusive distance vertex irregular labeling
  • Inclusive distance vertex irregularity strength

Fingerprint Dive into the research topics of 'On inclusive distance vertex irregular labelings'. Together they form a unique fingerprint.

Cite this