Combinatorics / CONCEPT
Characterizing well-covered Cayley squares
A connected finite abelian Cayley graph has a well-covered Cartesian square exactly when it is complete, and exactly when every positive distance power of that square is well-covered.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS0
All finite abelian groups and all positive powers
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 nearly empty Cartesian layerstructural-affinity · Closed
- An empty Cartesian layerstructural-affinity · Closed
- Coloring extensions and degree reductionstructural-affinity · Closed
- Components and Vertex Cutsstructural-affinity · Closed
- Deterministic Rainbow Two-Edge Choicesstructural-affinity · Closed
- Matching-twisted clique cyclesstructural-affinity · Closed
- Mobile general position on two exceptional cylindersstructural-affinity · Closed
- Theta graph structure and metric dimensionstructural-affinity · Closed
- Well-covered powers with unbounded diameterstructural-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