Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Yusuf Hafidh
Institut Teknologi Bandung
Electrical & Electronics Engineering

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

Found 1 Documents
Search

 1 
On the locating chromatic number of infinite trees Yusuf Hafidh; Devi Imulia Dian Primaskun; Edy Tri Baskoro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 14, No 2 (2026): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2026.14.2.3

Abstract

The locating chromatic number of a graph is the smallest integer n such that there exists a proper n-coloring c for which every vertex has a unique vector of distances to the color classes defined by c. If no such integer n exists, the locating chromatic number is infinite. We explore properties of the locating chromatic number of infinite graphs, focusing on sufficient and necessary conditions for an infinite tree to have a finite locating chromatic number. We conjectured that an infinite tree has a finite locating chromatic number if and only if the tree has bounded degree and is prunable. We prove that the conditions in the conjecture are sufficient and provide evidence as to why they might be necessary. Lastly, we compare the performance of our locating coloring algorithm with that of known locating coloring algorithms. Our algorithm outperforms previously known algorithms for trees with many branches.
Co-Authors Devi Imulia Dian Primaskun Edy Tri Baskoro