14 citations · 24 across the 4 of their papers we have counts for
4 papers
An atlas of domination polynomials of graphs of order at most six
Saeid Alikhani, Yee-hock Peng
The domination polynomial of a graph of order is the polynomial , where is the number of dominating sets of of size ,…
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…
Dominating sets and Domination polynomials of Cycles
Saeid Alikhani, Yee-hock Peng
Let G=(V,E) be a simple graph. A set S\subset V is a dominating set of G, if every vertex in V§is adjacent to at least one vertex in S. Let {\mathcal C}_n^i be the family of domina…
Introduction to Domination Polynomial of a Graph
Saeid Alikhani, Yee-hock Peng
We introduce a domination polynomial of a graph G. The domination polynomial of a graph G of order n is the polynomial D(G, x) =\sum_{i=1}^n d(G, i)x^i, where d(G, i) is the number…