Abstract: Let the wheel W n(n≥3) be a graph obta ined by joining one point outside the cycle C n to every vertex of C n. The graph derived from W n, by sticking one pendent edge at every vertex of C n, is denote d Q(W n). Sequential labelings of Q(W n ) are considered, and it i s proved that all Q(W n) are sequential graphs for every natura l number n≥3.