13 citations · 53 across the 39 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.CO2009★ 3 cited
Cycles are determined by their domination polynomials
Saieed Akbari, Mohammad Reza Oboudi
Let be a simple graph of order . A dominating set of is a set of vertices of so that every vertex of is either in or adjacent to a vertex in . The dom…
math.CO2009★ 3 cited
The Domination Polynomials of Cubic graphs of order 10
Saieed Akbari, Saeid Alikhani, Yee-hock Peng
Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x)=\sum_{i=γ(G)}^{n} d(G,i) x^{i}, where d(G,i) is the number of dominating sets of G of si…