Total vertex irregularity strength for trees with many vertices of degree two
| Main Authors: | Simanjuntak, Rinovia; Combinatorial Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesha 10 Bandung, Indonesia, Susilawati, Susilawati; Mathematics Department, Faculty of Mathematics and Natural Sciences, Universitas Riau, Kampus Bina Widya KM. 12,5, Pekanbaru, Indonesia, Baskoro, Edy Tri; Combinatorial Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesha 10 Bandung, Indonesia |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2020
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/1058 https://www.ejgta.org/index.php/ejgta/article/view/1058/pdf_150 |
Daftar Isi:
- For a simple graph G = (V,E), a mapping φ : V ∪ E → {1,2,...,k} is defined as a vertex irregular total k-labeling of G if for every two different vertices x and y, wt(x) ≠ wt(y), where wt(x) = φ(x)+ Σxy∈E(G) φ(xy). The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G. In this paper, we provide three possible values of total vertex irregularity strength for trees with many vertices of degree two. For each of the possible values, sufficient conditions for trees with corresponding total vertex irregularity strength are presented.