ConceptDynamics / CONCEPT
A Regular Link-Irregular Graph on Eleven Vertices
A kernel-checked proof that a known six-regular graph on eleven vertices is link-irregular.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES1
PROOF DEPTH0
DOCUMENT LINKS1
Isomorphisms preserve the refined profile
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Diagonal Escape Asymptoticsstructural-affinity · Closed
- Even Lucas Periodsstructural-affinity · Closed
- Golden Notationstructural-affinity · Closed
- Partial-Quotient Extractionstructural-affinity · Closed
- Polynomial Sign Formulas for Matrix Signaturesstructural-affinity · Closed
- Record Entropy Integralsstructural-affinity · Closed
- Stationing Countsstructural-affinity · Closed
- Symmetric Matrix Signature by Polynomial Pivotsstructural-affinity · Closed
- Trureturingstructural-affinity · Closed
- Zeros: Zeta Upgradestructural-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