N. Jafari

activity

20162021

most citedOn the roots of total domination polynomial of graphs

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2021

More on total domination polynomial and $D_{t}$ -equivalence classes of some 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…

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

Total domination polynomial of graphs from primary subgraphs

Saeid Alikhani, Nasrin Jafari

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

math.CO2016★ 1 cited

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…

More on total domination polynomial and Dt​-equivalence classes of some graphs

On the roots of total domination polynomial of graphs, II

Some new results on the total domination polynomial of a graph

Total domination polynomial of graphs from primary subgraphs

On the roots of total domination polynomial of graphs

More on total domination polynomial and $D_{t}$ -equivalence classes of some graphs