Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Johnathan Barnett"'
Autor:
Johnathan Barnett, Adam Blumenthal, Peter Johnson, Cadavious Jones, Ryan Matzke, Egbert Mujuni
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 14, Iss 3, Pp 216-223 (2017)
For any (finite simple) graph the secure domination number of satisfies . Here we find a secure-dominating set in such that in all cases when is a grid, and in the majority of cases when is a cylindrical or toroidal grid. In all such cases, satisfies
Externí odkaz:
https://doaj.org/article/c678aea33906490290f82a440091fd32
Publikováno v:
2021 ASEE Virtual Annual Conference Content Access Proceedings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2d1521bd7ee1730040ff0afdd599914
https://doi.org/10.18260/1-2--36645
https://doi.org/10.18260/1-2--36645
Autor:
Peter D. Johnson, Adam Blumenthal, Egbert Mujuni, Ryan Matzke, Johnathan Barnett, Cadavious M. Jones
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 14, Iss 3, Pp 216-223 (2017)
For any (finite simple) graph G the secure domination number of G satisfies γ s ( G ) ≥ | V ( G ) | 2 . Here we find a secure-dominating set S in G such that | S | = ⌈ | V ( G ) | 2 ⌉ in all cases when G is a grid, and in the majority of cases
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36d67d616a889f953fc1937e694215ec
https://doaj.org/article/c678aea33906490290f82a440091fd32
https://doaj.org/article/c678aea33906490290f82a440091fd32