Combinatorics / CONCEPT
Rooted decomposition and the connected minus-four family
A rooted-component decomposition gives a general weighted domination identity. Its checked application to the published graph, followed by support replication, gives connected graphs of unbounded order with root minus four.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS0
General weighted restriction and reassembly
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
- Dominating sets omitting a stemstructural-affinity · Closed
- One-leaf replication of partial dominating familiesstructural-affinity · Closed
- Real-root configurations of book domination polynomialsstructural-affinity · Closed
- Replicated dominating-set averagesstructural-affinity · Closed
- Sublinear edge completion for consecutive cycle sumsstructural-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
- Transporting residual 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