Combinatorics / CONCEPT
Božović Conjecture 12: limited domination in Sierpiński graphs
The k-limited domination number of the Sierpiński graph S(n,m) is proved exactly for n ≥ 1, 2 ≤ m, and 1 ≤ k ≤ m − 1.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS1
Conjecture 12 proved
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- A Dom-Path Longer Than the Jaco Graph Diameter Boundstructural-affinity · Closed
- An obstruction to global coalition universalitystructural-affinity · Closed
- Critical Vertices and Private Neighboursstructural-affinity · Closed
- Finite dominating-set averagesstructural-affinity · Closed
- Five paired coalition parts in the height-five binary treestructural-affinity · Closed
- Refutation of Annor Conjecture 14structural-affinity · Closed
- Regular Graph Covers and Dominationstructural-affinity · Closed
- The Koch-Narayan bipartite edge bound is falsestructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance