Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Wardah Masanggila Bent-Usman"'
Publikováno v:
European Journal of Pure and Applied Mathematics. 14:578-589
Let G = (V (G), E(G)) be a simple non-empty graph. For an integer k ≥ 1, a k-fairtotal dominating set (kf td-set) is a total dominating set S ⊆ V (G) such that |NG(u) ∩ S| = k for every u ∈ V (G)\S. The k-fair total domination n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00a8b68866369e3de427e7eb76a6c3bb
https://doi.org/10.29020/nybg.ejpam.v14i2.3967
https://doi.org/10.29020/nybg.ejpam.v14i2.3967
Publikováno v:
European Journal of Pure and Applied Mathematics. 12:1337-1349
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 t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0bc7654d60cd45e68d1540d5d7685173
https://doi.org/10.29020/nybg.ejpam.v12i3.3506
https://doi.org/10.29020/nybg.ejpam.v12i3.3506
Publikováno v:
Applied Mathematical Sciences. 12:1341-1355
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::160013836715c0212b92d8a8fbec6831
https://doi.org/10.12988/ams.2018.810145
https://doi.org/10.12988/ams.2018.810145