Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Indonesian Journal of Combinatorics
Faisal Susanto
Institut Teknologi Bandung
Computer Science & IT Decision Sciences, Operations Research & Management

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
A note on vertex irregular total labeling of trees Faisal Susanto; Rinovia Simanjuntak; Edy Tri Baskoro
Indonesian Journal of Combinatorics Vol 7, No 1 (2023)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2023.7.1.1

Abstract

The total vertex irregularity strength of a graph G=(V,E) is the minimum integer k so that there is a mapping from V ∪ E to the set {1,2,...,k} so that the vertex-weights (i.e., the sum of labels of a vertex together with the edges incident to it) are all distinct. In this note, we present a new sufficient condition for a tree to have total vertex irregularity strength ⌈(n1+1)/2⌉, where n1 is the number of vertices of degree one in the tree.
Co-Authors Edy Tri Baskoro Rinovia Simanjuntak