Total Vertex Irregularity Strength of Trees with Maximum Degree Five
2018  //  DOI: 10.5614/ejgta.2018.6.2.5
S. Susilawati, Edy Tri Baskoro, Rinovia Simanjuntak

Metrics

  • Eye Icon 44 views
  • Download Icon 36 downloads
Metrics Icon 44 views  //  36 downloads
Total Vertex Irregularity Strength of Trees with Maximum Degree Five Image
Abstract

In 2010, Nurdin, Baskoro, Salman and Gaos conjectured that the total vertex irregularity strength of any tree T is determined only by the number of vertices of degrees 1, 2 and 3 in T. This paper will confirm this conjecture by considering all trees with maximum degree five. Furthermore, we also characterize all such trees having the total vertex irregularity strength either t1, t2 or t3, where $t_{i} = \lceil (1+\sum\sb{j=1}\sp{i}n_{j})/(i+1)\rceil$ and ni is the number of vertices of degree i.

Full text
Show more arrow
 
More from this journal
Automorphism Group of Certain Power Graphs of Finite Groups
Automorphism Group of Certain Power Graphs of Finite Groups Image
On Energy, Laplacian Energy and $P$-fold Graphs
On Energy, Laplacian Energy and $P$\u002Dfold Graphs Image
Color Code Techniques In Rainbow Connection
Color Code Techniques In Rainbow Connection Image
🧐  Browse all from this journal

Metrics

  • Eye Icon 44 views
  • Download Icon 36 downloads
Metrics Icon 44 views  //  36 downloads