Combinatorics / CONCEPT
Distance Seidel energy after deleting an edge
Deleting any edge of a complete bipartite graph with both parts of size at least two strictly increases its distance Seidel energy for the matrix J - I - 2D.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH11
DOCUMENT LINKS0
Strict increase for every edge
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
- An entangled completely symmetric three-qutrit density matrixstructural-affinity · Closed
- BalancedHankelSchmidtstructural-affinity · Closed
- BalancedRealizationTransportstructural-affinity · Closed
- ExactGramianSeriesstructural-affinity · Closed
- InfiniteHankelGramianstructural-affinity · Closed
- Minimum Seidel energy of chain graphsstructural-affinity · Closed
- Ordered Balanced Coordinatesstructural-affinity · Closed
- Ordered Stable Balanced Truncationstructural-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