The upper bound for m-eternal eviction domination
The upper bound for m-eternal eviction domination
Let be a graph with vertices and no isolated vertices, and let denote its m-eternal eviction domination number. The m-eternal eviction bound conjecture. Then
The source does not provide evidence of a resolution, so the conjecture remains open in this database.
Sources & referencesView supporting material
Primary source
William F. Klostermeyer and Christina M. Mynhardt, “Protecting a Graph with Mobile Guards”, arXiv:1407.5228 (2015).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.