Yusuf Hafidh

activity

20192025

most citedOn the Locating Chromatic Number of Trees

2 citations · 2 across the 4 of their papers we have counts for

collaborators

6 papers

math.CO2025

Perfect codes in Cayley graphs of Hajós groups

Yusuf Hafidh, Binzhou Xia, Sanming Zhou

A perfect code in a graph $Γ$ is a subset $C$ of the vertex set of $Γ$ such that every vertex of $Γ$ outside $C$ has exactly one neighbour in $C$ . A perfect code in a directed grap…

math.CO2021

On the locating chromatic number of infinite trees

Yusuf Hafidh, Devi Imulia Dian Primaskun, Edy Tri Baskoro

The locating chromatic number of a graph is the smallest integer $n$ such that there is a proper $n$ -coloring $c$ and every vertex has a unique vector of distances to colors in $c$ …

math.CO2020

The Locating-Chromatic number of an $n$ -ary Trees

Yusuf Hafidh, Edy Tri Baskoro, Devi Imulia Dian Primaskun

The locating-chromatic number of a graph $G$ is the smallest integer $n$ , such that $G$ has a proper $n$ -coloring $c$ and all vertices have different vectors of distances to the co…

math.CO2019

The Ramsey Number for Tree Versus Wheel with Odd Order

Yusuf Hafidh, Edy Tri Baskoro

Chen et al. (2004) strongly conjectured that R(Tn,Wm)=2n-1 if the maximum degree of Tn is small and m is even. Related to the conjecture, it is interesting to know for which tree T…

math.CO2019★ 2 cited

On the Locating Chromatic Number of Trees

Yusuf Hafidh, Edy Tri Baskoro

Some coloring algorithms gives an upper bound for the locating chromatic number of trees with all the vertices not in an end-path colored by only two colors. That means, a better c…

math.CO2019

Multiset Dimensions of Trees

Yusuf Hafidh, Rizki Kurniawan, Suhadi Saputro +3

Let $G$ be a connected graph and $W$ be a set of vertices of $G$ . The representation multiset of a vertex $v$ with respect to $W$ , $r_{m} (v ∣ W)$ , is defined as a multiset of distance…