Domination Polynomials of Graph Products

Tomer Kotek1, James Preen1, Peter Tittmann2
1Faculty of Informatics, Mathematics, Vienna University of Technology, syne ee Ly Coca da Favoritenstr. 9-11, A-1040 Vienna, Austria
2Faculty Mathematics Sciences Computer Sciences Hochschule Mittweida – University of Applied Sciences Mittweida, Germany

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, including both explicit formulae and recurrences for specific families.