N. Jafari

activity

20162019

collaborators

3 papers

math.CO2019

On the roots of total domination polynomial of graphs, II

Saeid Alikhani, Nasrin Jafari

Let $G = (V, E)$ be a simple graph of order $n$ . The total dominating set of $G$ is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$ . The total domi…

math.CO2017

Some new results on the total domination polynomial of a graph

Saeid Alikhani, Nasrin Jafari

Let $G = (V, E)$ be a simple graph of order $n$ . The total dominating set of $G$ is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$ . The total domi…

math.CO2016

On the roots of total domination polynomial of graphs

Saeid Alikhani, Nasrin Jafari

Let $G = (V, E)$ be a simple graph of order $n$ . The total dominating set of $G$ is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$ . The total domi…