The edge neighborhood graph N_{e}(G) of a simple graph G is the graph with the vertex set E ∪ S where S is the set of all open edge neighborhood sets of G and two vertices u,v ∈ V (N_e{}(G)) adjacent if u ∈ E and v is an open edge neighborhood set containing u. In this paper, we determine the domination number, the total domination number, the independent domination number and the 2-domination number in the edge neighborhood graph. We also obtain a 2-domination polynomial of the edge neighborhood graph for some certain graphs.
Movahedi, F., & Akhbari, M. H. (2022). A note on some parameters of domination on the edge neighborhood graph of a graph. Caspian Journal of Mathematical Sciences, 11(1), 40-51. doi: 10.22080/cjms.2020.18804.1496
MLA
Fateme Movahedi; Mohammad hadi Akhbari. "A note on some parameters of domination on the edge neighborhood graph of a graph". Caspian Journal of Mathematical Sciences, 11, 1, 2022, 40-51. doi: 10.22080/cjms.2020.18804.1496
HARVARD
Movahedi, F., Akhbari, M. H. (2022). 'A note on some parameters of domination on the edge neighborhood graph of a graph', Caspian Journal of Mathematical Sciences, 11(1), pp. 40-51. doi: 10.22080/cjms.2020.18804.1496
VANCOUVER
Movahedi, F., Akhbari, M. H. A note on some parameters of domination on the edge neighborhood graph of a graph. Caspian Journal of Mathematical Sciences, 2022; 11(1): 40-51. doi: 10.22080/cjms.2020.18804.1496
)