Results 201 to 210 of about 39,709 (214)
Some of the next articles are maybe not open access.
Dynamic dominating sets: the eviction model for eternal domination
2016In a graph \(G = (V,E)\), a dominating set \(D\) is a subset of the vertices \(V\) such that every vertex is either in \(D\) or adjacent to one. Applications of dominating sets include communications, distributed computing and security. For instance, each node in the graph represents a strategic site that needs protection, and two nodes are connected ...
Klostermeyer, William F. +2 more
openaire +1 more source
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between
Algorithmica, 2021Fionn Mc Inerney +2 more
exaly
Eternal domination on prisms of graphs
Discrete Applied Mathematics, 2020Aaron Krim-Yee, Ben Seamone
exaly
Graphs with equal eternal vertex cover and eternal domination numbers
Discrete Mathematics, 2011William F Klostermeyer, C M Mynhardt
exaly
Foolproof eternal domination in the all-guards move model
Mathematica Slovaca, 2012William Klostermeyer +1 more
exaly
Trees with large m-eternal domination number
Discrete Applied Mathematics, 2016Michael A Henning +1 more
exaly
Domination and Eternal Domination of Jahangir Graph
Open Journal of Discrete Mathematics, 2019Ramy Shaheen +2 more
exaly
Changing and Unchanging in m-Eternal Total Domination in Graphs
Electronic Notes in Discrete Mathematics, 2016P Roushini Leely Pushpam
exaly