The Ramsey numbers for trees of order n with maximum degree at least $n-5$ versus the wheel graph of order nine

The Ramsey numbers R(Tₙ,W₈) are determined for each tree graph Tₙ of order n≥ 7 and maximum degree Δ(Tₙ) equal to either $n-4$ or $n-5$. These numbers indicate strong support for the conjecture, due to Chen, Zhang and Zhang and to Hafidh and Baskoro, that R(Tₙ,Wₘ) = 2n-1 for each tree graph Tₙ of order n≥ m-1 with Δ(Tₙ)≤ n-m+2 when m≥ 4 is even.