1 citations · 1 across the 2 of their papers we have counts for
5 papers
Some Families of Graphs with Small Power Domination Number
Najibeh Shahbaznejad, Adel P Kazemi, Ignacio M Pelayo
Let be a graph with the vertex set and be a subset of . Let be the set of vertices built from , by iteratively applying the following propag…
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…
Zero Forcing sets and Power Dominating sets of cardinality at most 2
Najibeh Shahbaznejad, Ignacio M. Pelayo, Adel P. Kazemi
Let be a set of vertices of a graph . Let be the set of vertices built from , by iteratively applying the following propagation rule: if a vertex and all but exac…
Total mixed domination in graphs
Farshad Kazemnejad, Adel P. Kazemi, Somayeh Moradi
For a graph , we call a subset a total mixed dominating set of if each element of is either adjacent or incident to an element of …
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…