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 math.COShow all

11 papers · 1 filter

math.CO2018

On the independent domination polynomial of a graph

Somayeh Jahari, Saeid Alikhani

An independent dominating set of the simple graph $G = (V, E)$ is a vertex subset that is both dominating and independent in $G$ . The independent domination polynomial of a graph $G$ …

math.CO2016★ 1 cited

Domination polynomial of clique cover product of 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

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…

math.CO2014★ 2 cited

Counting the number of weakly connected dominating sets of graphs

Saeid Alikhani, Somayeh Jahari, Mohammad Mehryar

Let $G = (V (G), E (G))$ be a simple graph. A non-empty set $S \subseteq V (G)$ is a weakly connected dominating set in $G$ , if the subgraph obtained from $G$ by removing all edges each…

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…

math.CO2014★ 1 cited

Some families of graphs whose domination polynomials are unimodal

Saeid Alikhani, Somayeh Jahari

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 Friendship Graphs

Saeid Alikhani, Jason Brown, Somayeh Jahari

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

math.CO2013

The edge cover polynomials of cubic graphs of order 10

Saeid Alikhani, Somayeh Jahari

Let $G$ be a simple graph of order $n$ and size $m$ . The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge…

On the independent domination polynomial of a graph

Domination polynomial of clique cover product of graphs

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

Counting the number of weakly connected dominating sets of graphs

On the domination polynomials of cactus chains

Some families of graphs whose domination polynomials are unimodal

On the Domination Polynomials of Friendship Graphs

The edge cover polynomials of cubic graphs of order 10

On $D$ -equivalence classes of some graphs