Join (graph theory)¶

A graph operation that takes two disjoint graphs and adds every possible edge between their vertex sets while retaining their internal edges.

Version: v2 · 2026-09-19 · History
Domain-specific #: 5146
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Graph Theory → Mathematics

Core Idea¶

The join is complementary to disjoint union under graph complementation, is associative up to isomorphism and sharply changes clique, chromatic, connectivity and spectral properties. The operands' vertices and edges are preserved, then a complete bipartite connection is inserted across the two parts so every vertex of one becomes adjacent to every vertex of the other. 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.

How would you explain it like I'm…

Connect Everyone Across

Draw two separate dot-and-line pictures. Keep all their lines as they are. Then draw a new line from every dot in the first picture to every dot in the second picture. That big new picture is their join.

Connect Every Dot Across

A graph is a set of dots connected by lines. To make the join of two graphs, you keep both graphs exactly as they are, with all their own lines. Then you draw a line from every dot in the first graph to every dot in the second graph. You don't add any new dots or any other lines. This makes the new graph much more connected than either part.

Graph Join: Full Cross-Wiring

The join of graphs G and H keeps all vertices and edges of both, then adds an edge between every vertex of G and every vertex of H — a complete bipartite connection across the two parts. Nothing else is added. This differs from the disjoint union, which puts the graphs side by side with no cross edges; in fact, the complement of a join is the disjoint union of the complements. Joining greatly changes properties: the largest clique sizes add together, and so do the numbers of colors needed. Joining in different orders gives the same graph up to relabeling.

For disjoint graphs G and H, the join G + H has vertex set V(G) ∪ V(H). Its edge set is E(G) ∪ E(H) together with all edges uv with u in V(G) and v in V(H). The cross part is the complete bipartite graph between the two vertex sets. Under complementation, the join is dual to disjoint union: the complement of G + H is the disjoint union of the complements of G and H. The operation is associative up to isomorphism. Clique number adds, ω(G+H) = ω(G) + ω(H), and chromatic number adds as well, since no color can be shared across the parts. Connectivity and spectral properties change sharply. A construction qualifies as a join only if the internal edges are retained, all cross edges are present, and nothing else is added.

Scope of Application¶

Join (graph theory) 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 two disjoint graphs, retained internal edges and all cross-part edges are explicit, with no other vertices or edges added. The scope is broad within that domain but bounded by the need for the two disjoint graphs, retained internal edges and all cross-part edges are explicit, with no other vertices or edges added. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the two disjoint graphs, retained internal edges and all cross-part edges are explicit, with no other vertices or edges added the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Join (graph theory) can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

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 Join (graph theory). Join (graph theory) 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.
Lock the constitutive rule. Express the two disjoint graphs, retained internal edges and all cross-part edges are explicit, with no other vertices or edges added 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 operands' vertices and edges are preserved, then a complete bipartite connection is inserted across the two parts so every vertex of one becomes adjacent to every vertex of the other., and type the carrier, state every parameter and convention in the definition, test that the two disjoint graphs, retained internal edges and all cross-part edges are explicit, with no other vertices or edges added, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Join (graph theory) Domain-specific

Parents (1) — outgoing typed relations

Join (graph theory) is a kind of Aggregation Prime

What makes it its own entry: the domain-specific identity determined by the two disjoint graphs, retained internal edges and all cross-part edges are explicit, with no other vertices or edges added.

Hierarchy path (1) — routes to 1 parentless root

Join (graph theory) → is a kind of Aggregation → is a kind of Transformation → is a kind of, typical Function (Mapping)

Neighborhood in Abstraction Space¶

Join (graph theory) sits in a crowded region of the domain-specific corpus (0^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Graph Theory Structures & Invariants (48 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25