N. Soltankhah

most citedOn the non-existence of some Steiner

t

(v, k)

trades of certain volumes

6 citations · 9 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2008★ 3 cited

On total dominating sets in graphs

Maryam Atapour, Nasrin Soltankhah

A set $S$ of vertices in a graph $G (V, E)$ is called a dominating set if every vertex $v \in V$ is either an element of $S$ or is adjacent to an element of $S$ . A set $S$ of vertices…

math.CO2008

Constructing regular graphs with smallest defining number

Behnaz Omoomi, Nasrin Soltankhah

In a given graph $G$ , a set $S$ of vertices with an assignment of colors is a {\sf defining set of the vertex coloring of $G$ }, if there exists a unique extension of the colors of…

math.CO2008★ 6 cited

On the non-existence of some Steiner $t$ - $(v, k)$ trades of certain volumes

Mehri Asgari, Nasrin Soltankhah

Mahmoodian and Soltankhah $\cite{MMS}$ conjectured that there does not exist any $t$ - $(v, k)$ trade of volume $s_{i} < s < s_{i + 1}$ , where $s_{i} = 2^{t + 1} - 2^{t - i}, i = 0, 1, ..., t - 1$ . Als…

On total dominating sets in graphs

Constructing regular graphs with smallest defining number

On the non-existence of some Steiner t-(v,k) trades of certain volumes

On the non-existence of some Steiner $t$ - $(v, k)$ trades of certain volumes