Total vertex irregularity strength of trees with maximum degree five
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 cha...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2018-10-10.
|
Subjects: | |
Online Access: | Get Fulltext Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
Item Description: | https://www.ejgta.org/index.php/ejgta/article/view/415 |