Vertex irregular total labeling of cubic graphs

Ali Ahmad, Syed Ahtsham Ul Haq Bokhary, Muhammad Imran, A. Q. Baig

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)


A vertex irregular total labeling φ of a graph G is a labeling of vertices and edges of G with labels from the set {1, 2, ⋯, K} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. The weight wt(x) of a vertex x in G is the sum of its label and the labels of all edges incident with a given vertex x. The minimum fc for which the graph G has a vertex irregular total labeling is called the total vertex irregularity strength of G, tvs(G). In this paper, we determine exact value of the toted vertex irregularity strength of cubic graphs and a conjecture is proposed to find tvs of r-reguleir graphs.

Original languageEnglish
Pages (from-to)287-299
Number of pages13
JournalUtilitas Mathematica
Publication statusPublished - Jul 2013
Externally publishedYes


  • Convex polytopes
  • Cubic plane graph
  • Total vertex irregularity strength
  • Vertex irregular total labeling
  • Vertex weight

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Applied Mathematics


Dive into the research topics of 'Vertex irregular total labeling of cubic graphs'. Together they form a unique fingerprint.

Cite this