The Independent Domination Polynomial
Combinatorics
2016-02-29 v1
Abstract
A vertex subset of the graph is an independent dominating set if every vertex in is adjacent to at least one vertex in and the vertices of 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.
Cite
@article{arxiv.1602.08250,
title = {The Independent Domination Polynomial},
author = {Markus Dod},
journal= {arXiv preprint arXiv:1602.08250},
year = {2016}
}