The Independent Domination Polynomial

MaRDI QIDQ6270860zbMATH OpenFDO

Authors Markus Dod

Publication date 26 February 2016

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: A vertex subset $WsubseteqV$ of the graph $G=(V,E)$ is an independent dominating set if every vertex in $$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. The independent domination polynomial is the ordinary generating function for the number of independent dominating sets in the graph. We investigate in this paper properties of the independent domination polynomial and some interesting connections to well known counting problems.

This page was built for publication: The Independent Domination Polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6270860)