Double graph¶

A graph construction that replaces every vertex with two nonadjacent copies and replaces each original edge with all four edges between the corresponding copy pairs.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4255
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Graph Products and Transformations → Mathematics

Core Idea¶

The double graph is expressible as a lexicographic or direct product under stated loop conventions and systematically doubles vertices and quadruples edges while preserving interpretable structural relations. Two layers of the original vertex set are formed; each original adjacency induces within-layer and cross-layer adjacencies between every copy of its endpoints, while copies of the same vertex remain nonadjacent. 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…

Twin Friends Map

Imagine a map of friends where lines connect friends. Now make a twin of every person. If two people were friends, now each copy of one is friends with each copy of the other. But a person and their own twin are not connected. That new, bigger map is the double graph.

Two-Layer Graph Copy

A Double Graph is a way of building a bigger graph from a smaller one. A graph is a set of dots with lines between some of them. You make two layers, each with a copy of every dot. Whenever two dots were connected in the original, you connect every copy of one to every copy of the other, both in the same layer and across layers. A dot is never connected to its own copy. So the number of dots doubles and the number of lines becomes four times as many.

Two-Layer Graph Doubling

The Double Graph of a simple graph G is built by taking two copies of G's vertex set. For every edge uv in G, you add edges between every copy of u and every copy of v, which gives two edges within the layers and two across them. Copies of the same vertex are not joined. As a result, the double graph has twice as many vertices and four times as many edges as G, while keeping G's adjacency pattern in a recognizable way. It can be described as a graph product, lexicographic or direct, with a small two-vertex factor, depending on the convention for loops. Stating the convention matters, because adding edges between a vertex and its copy gives a different construction.

The double graph of a simple graph G is formed by taking two layers of G's vertex set: each original adjacency uv induces edges between every copy of u and every copy of v, both within layers and across layers, while the two copies of any single vertex remain nonadjacent. Consequently the double graph has twice as many vertices and four times as many edges as G. Structurally it can be expressed as a lexicographic or direct product of G with a two-vertex factor, where the exact form depends on the stated loop convention for that factor. It systematically doubles vertices and quadruples edges while preserving interpretable structural relations of the original graph. A precise statement makes explicit that the input is simple, the copy labels, the product convention and looped factor, the induced edge rule, the absence of edges between copies of the same vertex, and the resulting vertex and edge counts.

Scope of Application¶

Double graph belongs to graph products and transformations and is useful where the analyst can specify the typed graph products and transformations carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the input is a simple graph, copy labels, product convention and looped factor, induced edge rule, absence of same-vertex copy edges, and resulting vertex and edge counts are explicit. The scope is broad within that domain but bounded by the need for the input is a simple graph, copy labels, product convention and looped factor, induced edge rule, absence of same-vertex copy edges, and resulting vertex and edge counts are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the input is a simple graph, copy labels, product convention and looped factor, induced edge rule, absence of same-vertex copy edges, and resulting vertex and edge counts 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 Double graph. Double 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 products and transformations 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 input is a simple graph, copy labels, product convention and looped factor, induced edge rule, absence of same-vertex copy edges, and resulting vertex and edge counts are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of graph products and transformations because they reuse the typed graph products and transformations carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Two layers of the original vertex set are formed; each original adjacency induces within-layer and cross-layer adjacencies between every copy of its endpoints, while copies of the same vertex remain nonadjacent., and type the carrier, state every parameter and convention in the definition, test that the input is a simple graph, copy labels, product convention and looped factor, induced edge rule, absence of same-vertex copy edges, and resulting vertex and edge counts are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Double graph Domain-specific

Parents (1) — outgoing typed relations

Double graph is a kind of Transformation Prime

It remains its own entry because its identity is fixed by the input is a simple graph, copy labels, product convention and looped factor, induced edge rule, absence of same-vertex copy edges, and resulting vertex and edge counts.

Hierarchy path (1) — routes to 1 parentless root

Double graph → is a kind of Transformation → is a kind of, typical Function (Mapping)

Neighborhood in Abstraction Space¶

Double graph sits in a crowded region of the domain-specific corpus (1^st 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