Eternal dominating set¶

A set of graph vertices occupied by mobile guards that can respond to every infinite sequence of vertex attacks while remaining a dominating set after each move.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4427
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Graph Theoretic Security Games → Mathematics

Core Idea¶

Eternal domination minimizes guards under a declared movement and attack model, with one-guard, all-guards, multiple-occupancy, and eviction variants producing different invariants.^[1] An adversary selects an attacked vertex, legal guards move along edges, one occupies the target when required, and the post-move configuration must dominate every vertex for the next attack. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of graph theoretic security games. It is the domain-specific identity determined by graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Eternal dominating set, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

How would you explain it like I'm…

Forever Guard Game

Picture a town of houses joined by paths, with a few guards standing at some houses. A sneaky troublemaker picks a house, and a guard must walk along a path to it. After moving, the guards must still be close enough to protect every house for the next attack, again and again forever. The puzzle is finding the fewest guards that can always do this.

The Never-Ending Guard Game

Imagine a network of dots connected by lines, like towns joined by roads, with guards standing on some dots. An attacker picks a dot to attack, and guards move along the lines so that one of them ends up on that dot. After the move, every dot must either have a guard or be right next to one, so the guards are ready for the next attack. This has to work no matter how many attacks come. An eternal dominating set asks for the fewest guards that can always do this, and the answer depends on the rules, like whether one guard or all guards may move each turn.

Infinite-Attack Graph Domination

In graph theory, a dominating set is a set of vertices such that every vertex is in the set or adjacent to it. Eternal domination turns this into a never-ending game. An adversary attacks a vertex, guards move along edges, one guard must occupy the attacked vertex when the rules require it, and the new guard positions must again form a dominating set. The aim is the minimum number of guards that can respond forever, which is harder than ordinary domination because the defense must survive every possible sequence of attacks. Rule variants matter: one guard moving per turn, all guards moving, allowing several guards on one vertex, or 'eviction' versions each give different minimum numbers. So the movement and attack rules must be stated exactly.

An eternal dominating set arises from a two-player game on a graph. Guards start on an initial vertex set; an adversary repeatedly selects an attacked vertex, and the defender responds by moving guards along edges, occupying the target when the model requires. The configuration after every response must again be a dominating set, so the defense can continue indefinitely against any attack sequence. The objective is to minimize the number of guards. Variants matter: the one-guard model (only one guard moves per turn), the all-guards model, models allowing multiple occupancy of a vertex, and eviction variants each define different parameters. A precise statement must specify the graph, the initial guard set, attack visibility and legality, the movement model, occupancy rules, the response rule, domination after every turn, adversary power, and the minimization objective. Changing any of these can change the resulting invariant.

Structural Signature¶

Carrier: the typed graph theoretic security games carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets
Inputs or antecedent state: the exact graph theoretic security games carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Eternal dominating set
Constitutive operation: An adversary selects an attacked vertex, legal guards move along edges, one occupies the target when required, and the post-move configuration must dominate every vertex for the next attack.
Invariant: graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit
Recognition test: type the carrier, state every parameter and convention in the definition, test that graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
Output or consequence: recognizing and comparing instances of Eternal dominating set, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition that graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of graph theoretic security games. The field contains many questions and methods that do not instantiate Eternal dominating set.
It is not its most familiar example. A canonical instance directly demonstrates that graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Dominating set. A dominating set covers the graph statically; eternal domination requires a sequence-robust reconfiguration strategy under repeated adversarial attacks.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Eternal dominating set must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside graph theoretic security games, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Eternal dominating set belongs to graph theoretic security games and is useful where the analyst can specify the typed graph theoretic security games carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit. The scope is broad within that domain but bounded by the need for graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact graph theoretic security games carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Eternal dominating set are converted, constrained, or organized by An adversary selects an attacked vertex, legal guards move along edges, one occupies the target when required, and the post-move configuration must dominate every vertex for the next attack..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Eternal dominating set must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Eternal dominating set, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Eternal dominating set can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact graph theoretic security games carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Eternal dominating set, the structure counts as Eternal dominating set exactly when graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Eternal dominating set. Eternal dominating set compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Eternal dominating set. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed graph theoretic security games carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit, infer recognizing and comparing instances of Eternal dominating set, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Eternal dominating set must control the decision and an object that resembles Eternal dominating set in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of graph theoretic security games because they reuse the typed graph theoretic security games carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, An adversary selects an attacked vertex, legal guards move along edges, one occupies the target when required, and the post-move configuration must dominate every vertex for the next attack., and type the carrier, state every parameter and convention in the definition, test that graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates that graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Eternal dominating set, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

A canonical instance directly demonstrates that graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit. The example exposes the carrier and directly tests that graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed graph theoretic security games carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets; the operative rule is An adversary selects an attacked vertex, legal guards move along edges, one occupies the target when required, and the post-move configuration must dominate every vertex for the next attack.; the invariant is graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit; and the result supports recognizing and comparing instances of Eternal dominating set, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit destroys the classification.

Mapped back: the typed graph theoretic security games carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets → An adversary selects an attacked vertex, legal guards move along edges, one occupies the target when required, and the post-move configuration must dominate every vertex for the next attack. → graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit → recognizing and comparing instances of Eternal dominating set, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Eternal dominating set, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Eternal dominating set, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from graph theoretic security games and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, An adversary selects an attacked vertex, legal guards move along edges, one occupies the target when required, and the post-move configuration must dominate every vertex for the next attack., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Eternal dominating set, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Eternal dominating set, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in graph theoretic security games.

This entry is a kind of Coverage / Reachability.

It remains its own entry because its identity is fixed by graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective.

Relationships to Other Abstractions¶

Current abstraction Eternal dominating set Domain-specific

Parents (1) — outgoing typed relations

Eternal dominating set is a kind of Coverage / Reachability Prime

It remains its own entry because its identity is fixed by graph, initial guard set, attack visibility and legality, movement model, occupancy, response rule, domination after every turn, adversary power, and minimum objective.

Hierarchy paths (2) — routes to 2 parentless roots

Eternal dominating set → is a kind of Coverage / Reachability → is a kind of Completeness

Show alternative path (1)

Neighborhood in Abstraction Space¶

Eternal dominating set sits in a crowded region of the domain-specific corpus (15^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Pursuit Games on Graphs (5 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25

Not to Be Confused With¶

Dominating set. A dominating set covers the graph statically; eternal domination requires a sequence-robust reconfiguration strategy under repeated adversarial attacks.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Eternal dominating set. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Eternal dominating set. An extension qualifies only when its changed axioms and retained invariant are stated.

References¶

[1] Gary MacGillivray, C. M Mynhardt, Virgélot Virgile, 'Eternal domination and clique covering', Electronic Journal of Graph Theory and Applications, 2022, doi:10.5614/ejgta.2022.10.2.19. registry ↩a ↩b

[2] M Anderson, C Barrientos, R Brigham, J Carrington, R Vitray, J Yellen, 'Maximum demand graphs for eternal security', J. Combin. Math. Combin. Comput, 2007. registry ↩a ↩b

[3] H Arquilla, H Fredricksen, 'Graphing an optimal grand strategy', Military Operations Research, 1995, doi:10.5711/morj.1.3.3. registry ↩