Combinatorics / CONCEPT
Minimum Seidel energy of chain graphs
Every connected chain graph has at least the Seidel energy of each member of Gamma(n,k), with equality precisely for the members of that family.
Closed
DIRECT PREREQUISITES4
DIRECT CONSEQUENCES2
PROOF DEPTH10
DOCUMENT LINKS0
Energy in an eigenbasis
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
- An entangled completely symmetric three-qutrit density matrixstructural-affinity · Closed
- BalancedHankelSchmidtstructural-affinity · Closed
- BalancedRealizationTransportstructural-affinity · Closed
- Distance Seidel energy after deleting an edgestructural-affinity · Closed
- Full-Rank Inertia Pullbackstructural-affinity · Closed
- Hankel Gramian Singular Valuesstructural-affinity · Closed
- InfiniteHankelGramianstructural-affinity · Closed
- Ordered Balanced Coordinatesstructural-affinity · Closed
- Ordered Stable Balanced Truncationstructural-affinity · Closed
- Weil: Pos Indexstructural-affinity · Closed
- Weil: Rank Tracestructural-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