Combinatorics / CONCEPT
Once-subdivided complete graphs have no edge multiset resolving set
Once-subdivided complete graphs have no edge multiset resolving set
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES0
PROOF DEPTH5
DOCUMENT LINKS0
no resolving set
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
- Complementing all landmarksstructural-affinity · Closed
- Four exact distance binsstructural-affinity · Closed
- Repeated augmented degrees force collisionsstructural-affinity · Closed
- Symmetric binary matrices with distinct row sumsstructural-affinity · Closed
- The diagonal-aware selection matrixstructural-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