The upper bound for m-eternal eviction domination

Let G=(V,E)G=(V,E) be a graph with nn vertices and no isolated vertices, and let ρm(G)\rho_{\mathrm{m}}^{\infty}(G) denote its m-eternal eviction domination number. The m-eternal eviction bound conjecture. Then

ρm(G)n2.\rho_{\mathrm{m}}^{\infty}(G)\leq\left\lceil\frac{n}{2}\right\rceil.

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

No solutions have been posted yet.