Corona product¶

A graph operation joining each vertex of one graph to every vertex of its own attached copy of a second graph.

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

Core Idea¶

Graph order, labeling and simple-versus-multigraph convention must be stated, and corona product is noncommutative in general. One center graph is retained, one disjoint copy of H is created per center vertex and edges connect that vertex to all vertices in its assigned copy. 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.

The load-bearing residual is not the broad topic of graph theory. It is the domain-specific identity fixed by the input graphs G and H, order of G, disjoint indexed copies of H, retained internal edges, assignment of one copy to each G vertex, complete incident joining edges, resulting vertex and edge counts, direction or loop convention and noncommutativity are explicit.

How would you explain it like I'm…

Every Dot Gets a Crown

Take a drawing of dots and lines. Next to every dot, place a copy of a second little drawing, and then connect the dot to every dot in its own copy. The result looks a bit like a crown with jewels around it — that's a corona product.

A Copy for Every Dot

In graph theory, a graph is a set of dots connected by lines. The corona product takes two graphs, G and H, and builds a new one. You keep G just as it is. Then, for each dot of G, you make a separate copy of H, keeping all of H's lines, and you connect that G dot to every dot in its own copy. Order matters: making the corona of G with H usually gives a different graph than the corona of H with G.

Center-and-Copies Graph Product

The corona product of two graphs G and H is built like this: keep G, and for each vertex of G create its own separate copy of H. Each copy keeps all its internal edges, and the G vertex it belongs to is joined by edges to every vertex of that copy. So if G has n vertices, you get n copies of H, one per vertex. Unlike many graph products, the corona product is generally not commutative — G corona H and H corona G are usually different graphs. When you use it you need to state the order of G, how vertices are labeled, and whether graphs are simple or allow multiple edges, since the vertex and edge counts depend on these choices.

The corona product of graphs G and H (often written G ∘ H) is formed by taking G, creating one disjoint copy of H for each vertex of G, indexed by those vertices, and joining each vertex of G by an edge to every vertex of its assigned copy of H. Internal edges of G and of each copy of H are retained. If G has n vertices and m edges and H has p vertices and q edges, the result has n(1 + p) vertices and m + n(q + p) edges. The construction is noncommutative in general, since G and H play asymmetric roles as center and attached pieces. A precise statement must fix the order of G, the labeling of copies, and conventions on simple versus multigraphs and on direction or loops.

Scope of Application¶

Corona product belongs to graph theory and is useful where the analyst can specify the typed graph theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the input graphs G and H, order of G, disjoint indexed copies of H, retained internal edges, assignment of one copy to each G vertex, complete incident joining edges, resulting vertex and edge counts, direction or loop convention and noncommutativity are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the input graphs G and H, order of G, disjoint indexed copies of H, retained internal edges, assignment of one copy to each G vertex, complete incident joining edges, resulting vertex and edge counts, direction or loop convention and noncommutativity are explicit 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 Corona product. Corona product 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, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the input graphs G and H, order of G, disjoint indexed copies of H, retained internal edges, assignment of one copy to each G vertex, complete incident joining edges, resulting vertex and edge counts, direction or loop convention and noncommutativity are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of graph theory because they reuse the typed graph theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, One center graph is retained, one disjoint copy of H is created per center vertex and edges connect that vertex to all vertices in its assigned copy., and type the carrier, state every parameter and convention in the definition, test that the input graphs G and H, order of G, disjoint indexed copies of H, retained internal edges, assignment of one copy to each G vertex, complete incident joining edges, resulting vertex and edge counts, direction or loop convention and noncommutativity are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Corona product Domain-specific

Parents (1) — outgoing typed relations

Corona product is a kind of Transformation Prime

It remains its own entry because its identity is fixed by the input graphs G and H, order of G, disjoint indexed copies of H, retained internal edges, assignment of one copy to each G vertex, complete incident joining edges, resulting vertex and edge counts, direction or loop convention and noncommutativity.

Hierarchy path (1) — routes to 1 parentless root

Corona product → is a kind of Transformation → is a kind of, typical Function (Mapping)

Neighborhood in Abstraction Space¶

Corona product sits in a crowded region of the domain-specific corpus (2^nd 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