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 2011Show all

4 papers · 1 filter

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…