most citedRecurrence relations and splitting formulas for the domination polynomial

1 citations

researchers with a paper here
collaborating institutions
Showing math.COShow all

2 papers · 1 filter

math.CO2012

Subset-Sum Representations of Domination Polynomials

Tomer Kotek, James Preen, Peter Tittmann

The domination polynomial D(G,x) is the ordinary generating function for the dominating sets of an undirected graph G=(V,E) with respect to their cardinality. We consider in this p…

math.CO2012★ 1 cited

Recurrence relations and splitting formulas for the domination polynomial

Tomer Kotek, James Preen, Frank Simon +2

The domination polynomial D(G,x) of a graph G is the generating function of its dominating sets. We prove that D(G,x) satisfies a wide range of reduction formulas. We show linear r…