Somayeh Jahari

activity

20132019

most citedDomination polynomial of generalized friendship and generalized book graphs

2 citations · 7 across the 9 of their papers we have counts for

collaborators

Showing 2015Show all

4 papers · 1 filter

math.CO2015

Domination polynomial of lexicographic product of specific graphs

Saeid Alikhani, Somayeh Jahari

Let $G$ be a simple graph of order $n$ . The domination polynomial of $G$ is the polynomial $D (G, λ) = \sum_{i = 0}^{n} d (G, i) λ^{i}$ , where $d (G, i)$ is the number of dominating sets of…

math.CO2015★ 1 cited

On $D$ -equivalence classes of some graphs

Somayeh Jahari, Saeid Alikhani

Let $G$ be a simple graph of order $n$ . The domination polynomial of $G$ is the polynomial $D (G, x) = \sum_{i = 1}^{n} d (G, i) x^{i}$ , where $d (G, i)$ is the number of dominating sets of $G$ …

math.CO2015

Some families of graphs with no nonzero real domination roots

S. Jahari, S. Alikhani

Let G be a simple graph of order n. The domination polynomial is the generating polynomial for the number of dominating sets of G of each cardinality. A root of this polynomial is…

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…

Domination polynomial of lexicographic product of specific graphs

On D-equivalence classes of some graphs

Some families of graphs with no nonzero real domination roots

Domination polynomial of generalized friendship and generalized book graphs

On $D$ -equivalence classes of some graphs