In this paper, we study the secure dominating sets of cycles and  secure domination polynomials of cycles in graph theory. We obtain the recursive formulas for the coefficients of secure domination polynomials of cycles. Using these recursive formulas, we construct the polynomial, which we call secure domination polynomial of the cycle and also obtain some properties of this polynomial.

domination, secure dominating set, secure dominating number, secure domination polynomial