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
A. N. M. Salman
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 
The total disjoint irregularity strength of some certain graphs Meilin I Tilukay; A. N. M. Salman
Indonesian Journal of Combinatorics Vol 4, No 2 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

Under a totally irregular total k-labeling of a graph G = (V,E), we found that for some certain graphs, the edge-weight set W(E) and the vertex-weight set W(V) of G which are induced by k = ts(G), W(E) ∩ W(V) is a non empty set. For which k, a graph G has a totally irregular total labeling if W(E) ∩ W(V) = ∅? We introduce the total disjoint irregularity strength, denoted by ds(G), as the minimum value k where this condition satisfied. We provide the lower bound of ds(G) and determine the total disjoint irregularity strength of cycles, paths, stars, and complete graphs.
Co-Authors Meilin Imelda Tilukay