2 citations · 2 across the 4 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
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 be a connected graph and be a set of vertices of . The representation multiset of a vertex with respect to , , is defined as a multiset of distance…