M. Mehryar

most citedCounting the number of weakly connected dominating sets of graphs

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

collaborators

2 papers

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…