Dergiler / Turkish Journal of Mathematics and Computer Science / 2018 / Cilt: 9 - Sayı: 9

On Domination Polynomials of Caterpillar Graphs

Sayfa
34–38
DOI
—

Abstract

The domination polynomial of a simple graph is calculated with such that is the number of the dominating sets of G of size . In this paper we study the domination polynomials of caterpillar graphs.