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

19 papers

math.CO2021

Some Families of Graphs with Small Power Domination Number

Najibeh Shahbaznejad, Adel P Kazemi, Ignacio M Pelayo

Let $G$ be a graph with the vertex set $V (G)$ and $S$ be a subset of $V (G)$ . Let $c l (S)$ be the set of vertices built from $S$ , by iteratively applying the following propag…

math.CO2020★ 1 cited

Total Dominator Total Chromatic Numbers of Wheels, Complete bipartite graphs and Complete graphs

Adel P. Kazemi, Farshad Kazemnejad

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 minim…

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$ .…

math.CO2018

Total mixed domination in graphs

Farshad Kazemnejad, Adel P. Kazemi, Somayeh Moradi

For a graph $G = (V, E)$ , we call a subset $S \subseteq V \cup E$ a total mixed dominating set of $G$ if each element of $V \cup E$ is either adjacent or incident to an element of $S$ …

math.CO2018★ 1 cited

Quasi-transversal in Latin Squares

Adel P. Kazemi, Behnaz Pahlavsay

In this paper, we first present the relation between a transversal in a Latin square with some concepts in its Latin square graph, and give an equivalent condition for a Latin squa…

math.CO2018★ 1 cited

Total dominator coloring of central graphs

Farshad Kazemnejad, Adel P. Kazemi

A total dominator coloring of a graph $G$ is a proper coloring of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromat…

math.CO2016★ 1 cited

Double Total Domination in Harary Graphs

Adel P. Kazemi, Behnaz Pahlavsay

Let $G$ be a graph with minimum degree at least 2. A set $D \subseteq V$ is a double total dominating set of $G$ if each vertex is adjacent to at least two vertices in $D$ . The doub…

math.CO2016★ 2 cited

k-Tuple Restrained Domination in Graphs

M. A. Henning, Adel P. Kazemi

For $k \geq 1$ an integer, a set $S$ of vertices in a graph $G$ with minimum degree at least~ $k - 1$ is a $k$ -tuple dominating set of $G$ if every vertex of $S$ is adjacent to at leas…

math.CO2016

Upper k-tuple total domination in graphs

Adel P. Kazemi

Let $G = (V, E)$ be a simple graph. For any integer $k \geq 1$ , a subset of $V$ is called a $k$ -tuple total dominating set of $G$ if every vertex in $V$ has at least $k$ neighbors in t…

math.CO2015★ 3 cited

Cartesian product graphs and $k$ -tuple total domination

Adel P. Kazemi, Behnaz Pahlavsay, Rebecca J. Stones

A $k$ -tuple total dominating set ( $k$ TDS) of a graph $G$ is a set $S$ of vertices in which every vertex in $G$ is adjacent to at least $k$ vertices in $S$ ; the minimum size of a $k…

math.CO2014★ 2 cited

Roman k-tuple domination number of a graph

Adel P. Kazemi

For any integer $k \geq 1$ and any graph $G = (V, E)$ with minimum degree at least $k - 1$ , we define a function $f : V \to {0, 1, 2}$ as a Roman $k$ -tuple dominating function on $G…

math.CO2013★ 8 cited

Total dominator chromatic number and Mycieleskian graphs

Adel P. Kazemi

A total dominator coloring of a graph $G$ is a proper coloring of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromat…

math.CO2013

Toat Dominator Chromatic number of a Graph

Adel P. Kazemi

Given a graph $G$ , the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a…

math.CO2011

k-tuple total restrained domination and k-tuple total restrained domatic in graphs

Adel P. Kazemi

Let $G$ be a graph of order $n$ and size $m$ and let $k \geq 1$ be an integer. A $k$ -tuple total dominating set in $G$ is called a $k$ -tuple total restrained dominating set of $G$ i…

math.CO2011

The k-Tuple Domatic Number of a Graph

Adel P. Kazemi

For every positive integer $k$ , a set $S$ of vertices in a graph $G = (V, E)$ is a $k$ -tuple dominating set of $G$ if every vertex of $V - S$ is adjacent to least $k$ vertices and every…

math.CO2011★ 2 cited

Roman domination and Mycieleki's structure in graphs

Adel P. Kazemi

For a graph $G = (V, E)$ , a function $f : V \to {0, 1, 2}$ is called Roman dominating function (RDF) if for any vertex $v$ with $f (v) = 0$ , there is at least one vertex $w$ in its…

math.CO2011

k-Tuple_Total_Domination_in_Inflated_Graphs

Adel P. Kazemi

The inflated graph $G_{I}$ of a graph $G$ with $n (G)$ vertices is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete gr…

Some Families of Graphs with Small Power Domination Number

Total Dominator Total Chromatic Numbers of Wheels, Complete bipartite graphs and Complete graphs

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 mixed domination in graphs

Quasi-transversal in Latin Squares

Total dominator coloring of central graphs

Double Total Domination in Harary Graphs

k-Tuple Restrained Domination in Graphs

Upper k-tuple total domination in graphs

Cartesian product graphs and k-tuple total domination

Roman k-tuple domination number of a graph

Total dominator chromatic number and Mycieleskian graphs

Toat Dominator Chromatic number of a Graph

k-tuple total restrained domination and k-tuple total restrained domatic in graphs

The k-Tuple Domatic Number of a Graph

Roman domination and Mycieleki's structure in graphs

k-Tuple_Total_Domination_in_Inflated_Graphs

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

Cartesian product graphs and $k$ -tuple total domination