TY - JOUR
AU - S. Susilawati
AU - Edy Tri Baskoro
AU - Rinovia Simanjuntak
T1 - Total Vertex Irregularity Strength of Trees with Maximum Degree Five
T2 - Electronic Journal of Graph Theory and Applications
JF - Electronic Journal of Graph Theory and Applications
DA - 2018///
PY - 2018
IS - 2
VL - 6
SP - 250
EP - 257
AB - 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.
DO - 10.5614/ejgta.2018.6.2.5
ER -