Combinatorics / CONCEPT
The one-copy hub isomorphism
For a stem with a unique leaf, the original graph is exactly its one-copy hub graph up to vertex labels.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH4
DOCUMENT LINKS0
Preservation of the global average
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
- Rooted decomposition and the connected minus-four familystructural-affinity · Closed
- The local average at a stemstructural-affinity · Closed
- The order-33 integer domination-root minimality claimstructural-affinity · Closed
- The stem-conditioned splitstructural-affinity · Closed
- Transporting residual dominationstructural-affinity · Closed
- Two-Thirds Bound for Dominating-Set Averagesstructural-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