Şahin, BünyaminŞahin, Abdulgani2024-10-042024-10-0420182148-1830https://search.trdizin.gov.tr/tr/yayin/detay/349313http://hdl.handle.net/20.500.12403/4583The domination polynomial of a simple graph G is calculated with D(G, x) =Pn i=1 d(G, i)x i such thatd(G, i) is the number of the dominating sets of G of size i. In this paper we study the domination polynomials ofcaterpillar graphs.eninfo:eu-repo/semantics/openAccessArticle993438349313