Domination Polynomials of Graph Products
Combinatorics
2013-12-25 v2
Abstract
The domination polynomials of binary graph operations, aside from union, join and corona, have not been widely studied. We compute and prove recurrence formulae and properties of the domination polynomials of families of graphs obtained by various products, ranging from explicit formulae and recurrences for specific families to more general results. As an application, we show the domination polynomial is computationally hard to evaluate.
Cite
@article{arxiv.1305.1475,
title = {Domination Polynomials of Graph Products},
author = {Tomer Kotek and James Preen and Peter Tittmann},
journal= {arXiv preprint arXiv:1305.1475},
year = {2013}
}
Comments
17 pages