4 citations · 5 across the 5 of their papers we have counts for
8 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…
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…