Abstract: For two given graphs and , the Ramsey number is the smallest integer n such that for any graph G of order n, either G contains or the complement of G contains . Let denote a path of order n and a wheel of order . In this paper, we show that for m even and and for m odd and . [Copyright &y& Elsevier]