For two graphs \(G_1\) and \(G_2\), the star-critical Ramsey number \(r_*(G_1,G_2)\) is the minimum integer k such that any red/blue edge-coloring of \(K_{r-1}\sqcup K_{1,k}\) contains a red copy of \(G_1\) or a blue copy of \(G_2\), where r is the classical Ramsey number \(R(G_1,G_2)\) and \(K_{r-1}\sqcup K_{1,k}\) is the graph obtained from a \(K_{r-1}\) and an additional vertex v by joining v to k vertices of \(K_{r-1}\). Let \(C_n\) denote a cycle of order n and \(W_m\) a wheel of order \(m+1\). Hook (2010) proved that \(r_*(C_n,W_3)=2n\) for \(n\ge 5\). In this paper, it is shown that \(r_*(C_n,W_m)=2n\) for m odd, \(n\ge m\ge 5\) and \(n\ge 60\).

对于两个图\(G_1\)和\(G_2\)，星临界拉姆齐数\(r_*(G_1,G_2)\)是最小整数k，使得\(K_ {R-1} \ sqcup K_ {1，K} \）包含的红色复制\（G_1 \）或的蓝色复制\（G_2 \） ，其中[R是经典Ramsey数\（R（G_1，G_2 ）\）和\（K_ {R-1} \ sqcup K_ {1，K} \）是从所得到的曲线图\（K_ {R-1} \）和另外的顶点v通过接合v到ķ的顶点\(K_{r-1}\)。让\(C_n\)表示n阶循环和\(W_m\)阶轮\(m+1\)。Hook (2010) 证明了\(r_*(C_n,W_3)=2n\)对于\(n\ge 5\)。在本文中，表明\(r_*(C_n,W_m)=2n\)对于m奇数，\(n\ge m\ge 5\)和\(n\ge 60\)。