Somayeh Jahari

most citedDomination polynomials of k-tree related graphs

2 citations · 4 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2015★ 2 cited

Domination polynomial of generalized friendship and generalized book graphs

Somayeh Jahari, Saeid Alikhani

Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized frien…

math.CO2014★ 2 cited

Domination polynomials of k-tree related graphs

S. Jahari, S. Alikhani

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…

math.CO2014

On the domination polynomials of cactus chains

Saeid Alikhani, Somayeh Jahari, Mohammad Mehryar

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…