Gürsoy, Necla KırcalıÜLKER, ALPERGürsoy, Arif2023-03-142023-03-142022Kırcalı Gürsoy, N., Ülker, A. & Gürsoy, A. Independent domination polynomial of zero-divisor graphs of commutative rings. Soft Comput 26;(15), 6989–6997 (2022).1432-7643https://doi.org/10.1007/s00500-022-07217-2https://hdl.handle.net/11413/8369An independent dominating set of a graph is a vertex subset that is both dominating and independent set in the graph, i.e., a maximal independent set. Also, the independent domination polynomial is an ordinary generating function for the number of independent dominating sets in the graph. In this paper, we examine independent domination polynomials of zero-divisor graphs of the ring Z(n) where n is an element of {2p, p(2), p(alpha), pq, p(2)q, pqr) and their roots. Finally, we prove the log-concavity and unimodality of their independent domination polynomials.eninfo:eu-repo/semantics/restrictedAccessIndependent Domination PolynomialIndependent Dominating SetZero-divisor GraphIndependent SetDomination NumberMaximal Independent SetArticle0008258010000042-s2.0-85132759411