Combinatorics / CONCEPT
Transporting residual domination
Embedding finite sets of induced-graph vertices into the original labels preserves cardinalities and averages.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES2
PROOF DEPTH3
DOCUMENT LINKS0
Preservation of the mean
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Deleting a stem and its leavesstructural-affinity · Closed
- Dominating sets omitting a stemstructural-affinity · Closed
- Equality Graphs for the Two-Thirds Boundstructural-affinity · Closed
- One-leaf replication of partial dominating familiesstructural-affinity · Closed
- Replicated dominating-set averagesstructural-affinity · Closed
- Rooted decomposition and the connected minus-four familystructural-affinity · Closed
- The local average at a stemstructural-affinity · Closed
- The one-copy hub isomorphismstructural-affinity · Closed
- The order-33 integer domination-root minimality claimstructural-affinity · Closed
- The stem-conditioned splitstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance