21 citations · 40 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications
Seongmin Ok, Peter Tittmann
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We sh…
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…