Neighborhood Connected k-Fair Domination Under Some Binary Operations
2019 ◽
Vol 12
(3)
◽
pp. 1337-1349
Keyword(s):
Let G=(V(G),E(G)) be a simple graph. A neighborhood connected k-fair dominating set (nckfd-set) is a dominating set S subset V(G) such that |N(u) intersection S|=k for every u is an element of V(G)\S and the induced subgraph of S is connected. In this paper, we introduce and invistigate the notion of neighborhood connected k-fair domination in graphs. We also characterize such dominating sets in the join, corona, lexicographic and cartesians products of graphs and determine the exact value or sharp bounds of their corresponding neighborhood connected k-fair domination number.
2019 ◽
Vol 12
(4)
◽
pp. 1643-1655
Keyword(s):
2018 ◽
Vol 11
(05)
◽
pp. 1850075
2021 ◽
Vol 14
(3)
◽
pp. 803-815
2020 ◽
Vol 12
(06)
◽
pp. 2050072
2019 ◽
Vol 12
(01)
◽
pp. 2050008
◽
Keyword(s):
2020 ◽
Vol 12
(02)
◽
pp. 2050025
Keyword(s):
Keyword(s):
2021 ◽
Vol 14
(3)
◽
pp. 1015-1023
Keyword(s):
2017 ◽
Vol 48
(2)
◽
pp. 135-147
◽