4 citations · 7 across the 10 of their papers we have counts for
10 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…
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…
Total dominator total chromatic numbers of cycles and paths
Adel P. Kazemi, Farshad Kazemnejad
The 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 m…
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 …
Total dominator coloring of central graphs
Farshad Kazemnejad, Adel P. Kazemi
A total dominator coloring of a graph is a proper coloring of in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromat…