Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Ammar Babikir"'
Autor:
Ammar Babikir, Michael A. Henning
Publikováno v:
Graphs and Combinatorics. 38
Publikováno v:
Graphs and Combinatorics. 37:691-709
A set S of vertices in a graph G is a dominating set if every vertex not in S is ad jacent to a vertex in S. If, in addition, S is an independent set, then S is an independent dominating set. The independent domination number i(G) of G is the minimum
Autor:
Ammar Babikir, Michael A. Henning
Publikováno v:
Graphs and Combinatorics. 38
Autor:
Ammar Babikir, Michael A. Henning
Publikováno v:
Discrete Mathematics. 345:112784
Autor:
Ammar Babikir, Michael A. Henning
Publikováno v:
Discrete Mathematics. 343:111727
A set S of vertices in a graph G is a dominating set if every vertex not in S is adjacent to a vertex in S . If, in addition, S is an independent set, then S is an independent dominating set. The domination number γ ( G ) of G is the minimum cardina
Publikováno v:
2013 International Conference on Computer Applications Technology (ICCAT); 2013, p1-4, 4p
Autor:
Babikir, Ammar1 (AUTHOR), Henning, Michael A.1 (AUTHOR) mahenning@uj.ac.za
Publikováno v:
Graphs & Combinatorics. Dec2022, Vol. 38 Issue 6, p1-31. 31p.
Autor:
Babikir, Ammar1 (AUTHOR), Dettlaff, Magda2 (AUTHOR), Henning, Michael A.1 (AUTHOR), Lemańska, Magdalena2 (AUTHOR) magdalena.lemanska@pg.edu.pl
Publikováno v:
Graphs & Combinatorics. May2021, Vol. 37 Issue 3, p691-709. 19p.
Publikováno v:
2013 International Conference on Computer Applications Technology (ICCAT); 2013, p1-3, 3p