4 citations · 10 across the 9 of their papers we have counts for
11 papers
Total outer-connected domination number of middle graphs
Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato +1
In this paper, we study the total outer-connected domination number of the middle graph of a simple graph and we obtain tight bounds for this number in terms of the order of the mi…
Connected and outer-connected domination number of middle graphs
Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato +1
In this paper, we study the notions of connected domination number and of outer-connected domination number for middle graphs. Indeed, we obtain tight bounds for this number in ter…
New classification of graphs in view of the domination number of central graphs
Shinya Fujita, Farshad Kazemnejad, Behnaz Pahlavsay
For a graph , the central graph is the graph constructed from by subdividing each edge of with one vertex and also by adding an edge to every pair of non-adjacent…
Total domination number of middle graphs
Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato +1
A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number…
Total dominator coloring number of middle graphs
Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato +1
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 chromatic n…
Domination number of middle graphs
Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato +1
In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph. We also compute the domination nu…
Domination for latin square graphs
Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli
In combinatorics, a latin square is a matrix filled with n different symbols, each occurring exactly once in each row and exactly once in each column. Associated to eac…
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…
-tuple total domination number of rook's graphs
Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli
A -tuple total dominating set (TDS) of a graph is a set of vertices in which every vertex in is adjacent to at least vertices in . The minimum size of a $k…
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…
Cartesian product graphs and -tuple total domination
Adel P. Kazemi, Behnaz Pahlavsay, Rebecca J. Stones
A -tuple total dominating set (TDS) of a graph is a set of vertices in which every vertex in is adjacent to at least vertices in ; the minimum size of a $k…