Combinatorics / CONCEPT
One-leaf replication of partial dominating families
A hub with one pendant leaf connects replicated graph copies at a prescribed vertex set.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES2
PROOF DEPTH2
DOCUMENT LINKS0
Absence of isolated vertices
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
- Critical Vertices and Private Neighboursstructural-affinity · Closed
- Deleting a stem and its leavesstructural-affinity · Closed
- Dominating sets omitting a stemstructural-affinity · Closed
- Finite dominating-set averagesstructural-affinity · Closed
- Real-root configurations of book domination polynomialsstructural-affinity · Closed
- Replicated dominating-set averagesstructural-affinity · Closed
- Rooted decomposition and the connected minus-four familystructural-affinity · Closed
- The hub and tail construction for consecutive cycle sumsstructural-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
- Transporting residual dominationstructural-affinity · Closed
- Trapezohedral minimal dominationstructural-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