Abstract: Let \( W_M \) be the wheel graph on \( M \geq 4 \) vertices and let \( \overline{K_n} \) be the independent graph on \( n \geq 1 \) vertices. We study the corona product \( W_M \circ K_n \) and obtain an explicit formula for its pendant domination polynomial. The computation starts from the domination polynomial and subtracts a correction term that counts dominating sets whose induced subgraph contains no vertex of degree 1. For the wheel, the correction term reduces to counting subsets of the rim cycle for which the selected rim vertices are not isolated on the rim. We also determine the pendant domination number for this family.