Zobrazeno 1 - 10
of 3 141
pro vyhledávání: '"K. Fair"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bent-Usman, Wardah M.1 wardah.bentusman@msumain.edu.ph, Isla, Rowena T.2 rowena.isla@g.msuiit.edu.ph
Publikováno v:
European Journal of Pure & Applied Mathematics. 2021, Vol. 14 Issue 2, p578-589. 12p.
Autor:
Ortega, Marivir M.1 marivir.ortega@g.msuiit.edu.ph, Isla, Rowena T.1,2 rowena.isla@g.msuiit.edu.ph
Publikováno v:
European Journal of Pure & Applied Mathematics. 2020, Vol. 13 Issue 4, p779-793. 15p.
Autor:
Bent-Usman, Wardah M.1 (AUTHOR) wardah_bentusman@yahoo.com, Isla, Rowena T.2 (AUTHOR) rowena.isla@g.msuiit.edu.ph, Canoy Jr., Sergio R.2 (AUTHOR) sergio.canoy@g.msuiit.edu.ph
Publikováno v:
European Journal of Pure & Applied Mathematics. 2019, Vol. 12 Issue 3, p1337-1349. 13p.
Autor:
Tina Novak, Janez Žerovnik
Publikováno v:
Operations research forum, vol. 3, no. 3, 46, 2022.
A set D of vertices in a graph G is a k-fair dominating set if every vertex not in D is adjacent to exactly k vertices in D. The weighted k-fair domination number ▫$wfd_k(G)$▫ of a vertex-weighted graph G is the minimum weight w(D) among all k-fa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c42b0441da779205226e72508b3eb622
https://repozitorij.uni-lj.si/Dokument.php?id=160277&dn=
https://repozitorij.uni-lj.si/Dokument.php?id=160277&dn=
Publikováno v:
Journal of Business Ethics, 2009 Oct 01. 89(2), 173-188.
Externí odkaz:
https://www.jstor.org/stable/40295048
Autor:
Rowena T. Isla, Marivir Ortega
Publikováno v:
European Journal of Pure and Applied Mathematics. 13:779-793
In this paper, we introduce and investigate the concepts of semitotal k-fair domination and independent k-fair domination, where k is a positive integer. We also characterize the semitotal 1-fair dominating sets and independent k-fair dominating sets
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1c12dd77f51bd5cbcbb74186c5176e4
https://doi.org/10.29020/nybg.ejpam.v13i4.3812
https://doi.org/10.29020/nybg.ejpam.v13i4.3812
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