Self-complementary graph¶
A graph isomorphic to its complement, so some vertex relabeling exchanges edges with nonedges while preserving graph structure.
Core Idea¶
Self-complementarity imposes arithmetic and structural constraints, including exactly half the possible edges in finite simple cases, and appears in Paley graphs, the Rado graph, and symmetry constructions. The complement is formed on the same vertex set by reversing adjacency off the diagonal; a bijection of vertices is then tested for mapping every edge of the original to a nonedge and conversely. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
Self-complementary graph belongs to graph theory and is useful where the analyst can specify the typed graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the graph is simple under a declared finite or infinite convention, the complement uses the same vertices, an explicit isomorphism or existence proof exchanges adjacency and nonadjacency, and order constraints are satisfied. The scope is broad within that domain but bounded by the need for the graph is simple under a declared finite or infinite convention, the complement uses the same vertices, an explicit isomorphism or existence proof exchanges adjacency and nonadjacency, and order constraints are satisfied.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the graph is simple under a declared finite or infinite convention, the complement uses the same vertices, an explicit isomorphism or existence proof exchanges adjacency and nonadjacency, and order constraints are satisfied the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Self-complementary graph. Self-complementary graph compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the graph is simple under a declared finite or infinite convention, the complement uses the same vertices, an explicit isomorphism or existence proof exchanges adjacency and nonadjacency, and order constraints are satisfied independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of graph theory because they reuse the typed graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, The complement is formed on the same vertex set by reversing adjacency off the diagonal; a bijection of vertices is then tested for mapping every edge of the original to a nonedge and conversely., and type the carrier, state every parameter and convention in the definition, test that the graph is simple under a declared finite or infinite convention, the complement uses the same vertices, an explicit isomorphism or existence proof exchanges adjacency and nonadjacency, and order constraints are satisfied, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Self-complementary graph Domain-specific
Parents (1) — more general patterns this builds on
-
Self-complementary graph is a kind of Symmetry Prime
The proposed strict upward parent is
prime:symmetry.
Hierarchy path (1) — routes to 1 parentless root
- Self-complementary graph → Symmetry
Neighborhood in Abstraction Space¶
Self-complementary graph sits in a crowded region of the domain-specific corpus (0th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Graph Invariants & Constructions (49 abstractions)
Nearest neighbors
- Join (graph theory) — 0.97
- Split graph — 0.96
- Graph isomorphism — 0.96
- Orientation (graph theory) — 0.95
- Independent set (graph theory) — 0.95
Computed from structural-signature embeddings · 2026-09-08