A. Kazemi

activity

20112021

most citedTotal dominator chromatic number and Mycieleskian graphs

8 citations · 23 across the 18 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

Total dominator total chromatic numbers of cycles and paths

Adel P. Kazemi, Farshad Kazemnejad

The total dominator total coloring of a graph is a total coloring of the graph such that each object of the graph is adjacent or incident to every object of some color class. The m…

math.CO2019★ 1 cited

Zero Forcing sets and Power Dominating sets of cardinality at most 2

Najibeh Shahbaznejad, Ignacio M. Pelayo, Adel P. Kazemi

Let $S$ be a set of vertices of a graph $G$ . Let $c l (S)$ be the set of vertices built from $S$ , by iteratively applying the following propagation rule: if a vertex and all but exac…

math.CO2019★ 1 cited

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 total chromatic numbers of cycles and paths

Zero Forcing sets and Power Dominating sets of cardinality at most 2

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

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