Parvin Jalilolghadr

most citedTotal dominator chromatic number of Kneser graphs

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

collaborators

2 papers

math.CO2020★ 1 cited

Total dominator chromatic number of Kneser graphs

Parvin Jalilolghadr, Ali Behtoei

In this paper among some other results and by using the existance of Steiner triple systems, we determine the total dominator chromatic number of the Kneser graph KG(n,2).

math.CO2019

Total dominator coloring of circulant graphs $C_{n} (a, b)$

Adel P. Kazemi, Parvin Jalilolghadr, Abdollah Khodkar

The circulant graph $C_{n} (S)$ with connection set $S \subseteq {1, 2, \dots, n}$ is the graph with vertex set $V = {1, \dots, n}$ and two vertices $x, y$ are adjacent if $∣ x - y ∣ \in S$ .…

Total dominator chromatic number of Kneser graphs

Total dominator coloring of circulant graphs Cn​(a,b)

Total dominator coloring of circulant graphs $C_{n} (a, b)$