3 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO2017★ 3 cited
Counting Dominating Sets of Graphs
Irene Heinrich, Peter Tittmann
Counting dominating sets in a graph is closely related to the neighborhood complex of . We exploit this relation to prove that the number of dominating sets of a grap…
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…