8 citations · 23 across the 18 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016★ 1 cited
Double Total Domination in Harary Graphs
Adel P. Kazemi, Behnaz Pahlavsay
Let be a graph with minimum degree at least 2. A set is a double total dominating set of if each vertex is adjacent to at least two vertices in . The doub…
math.CO2016★ 2 cited
k-Tuple Restrained Domination in Graphs
M. A. Henning, Adel P. Kazemi
For an integer, a set of vertices in a graph with minimum degree at least~ is a -tuple dominating set of if every vertex of is adjacent to at leas…
math.CO2016
Upper k-tuple total domination in graphs
Adel P. Kazemi
Let be a simple graph. For any integer , a subset of is called a -tuple total dominating set of if every vertex in has at least neighbors in t…