ABSTRACT. A dominating set \( S \) in \( G \) is called a pendant dominating set if \( \langle S \rangle \) contains at least one pendant vertex. The minimum cardinality of a pendant dominating set is called the pendant domination number, denoted by \( \gamma_{pe}(G) \). The pendant domination polynomial of \( G \) is denoted by \( D_{pe}(G,x) \) and is defined as\[D_{pe}(G,x)=\sum_{i=\gamma_{pe}(G)}^{n} d_{pe}(G,i)\,x^{i},\]where \( d_{pe}(G,i)x^{i} \) is the number of pendant dominating sets of size \( i \). In this paper, we obtained the pendant domination number and pendant domination polynomial of the corona of some graphs, namely, \( P_m \circ K_n \), \( C_m \circ K_n \), and \( K_m \circ K_n \).