Graph isomorphism¶

A bijection between two graph vertex sets that preserves adjacency and nonadjacency, showing that the graphs have the same structure up to relabeling.

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

Core Idea¶

Graph type must be fixed—directed, labeled, weighted or multigraph variants add preserved structure—an isomorphism is a witness mapping rather than merely matching numerical invariants, and automorphism is the self-map case. A candidate vertex bijection transports every incidence relation from one graph to the other; if both edges and nonedges correspond, relabeling by the map makes the adjacency structures identical. 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…

Secretly the Same Toy

Two people build stick-and-ball toys and give the balls different names. The toys are really the same if you can match each ball in one toy to a ball in the other. The match must work so that whenever two balls are joined by a stick in one toy, their partners are joined in the other, and whenever they aren't joined, their partners aren't either. That matching is called an isomorphism.

Connection-Keeping Match

Two graphs are isomorphic when you can pair up their dots one-to-one in a way that keeps all the connections. If two dots are connected in the first graph, their partners must be connected in the second. If they aren't connected, their partners must not be either. The pairing itself is the proof. Having the same number of dots and lines is a good first check, but it doesn't prove the graphs are the same. A pairing of a graph with itself is called an automorphism, and it shows the graph's symmetry.

Adjacency-Preserving Bijection

An isomorphism between graphs G and H is a one-to-one, onto map of vertices that preserves adjacency in both directions. Edges go to edges, and non-edges go to non-edges. You must first fix what kind of graph you mean. Directed, weighted, labeled, or multi-edge graphs require the map to preserve that extra structure too. Matching numbers like vertex counts or degree sequences can rule an isomorphism out, but can't prove one exists; only an explicit mapping does that. An isomorphism from a graph to itself is an automorphism. Checking a proposed map is easy, but searching for one can be much harder.

Given two graphs of a fixed type, an isomorphism is a bijection φ: V(G) → V(H) with uv ∈ E(G) ⇔ φ(u)φ(v) ∈ E(H). Adjacency is preserved in both directions, so non-edges correspond as well, and relabeling G by φ produces exactly the adjacency structure of H. The graph-type convention determines what else must be preserved: loops, edge multiplicities, directions, labels, or weights. The inverse map is also an isomorphism, so the relation partitions graphs into isomorphism classes. Automorphisms are the isomorphisms from a graph to itself. Invariants such as vertex count or degree sequence serve only as filters. Unequal values refute isomorphism, but equal values do not establish it. Verifying a proposed witness map is easy, while searching for one can be computationally hard.

Scope of Application¶

Graph isomorphism 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 two graph carriers and graph-type convention, vertex and edge sets, candidate vertex bijection, adjacency preservation in both directions, treatment of loops multiplicity directions labels or weights, inverse mapping, isomorphism class, automorphism special case, invariants as filters and witness verification versus search complexity are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the two graph carriers and graph-type convention, vertex and edge sets, candidate vertex bijection, adjacency preservation in both directions, treatment of loops multiplicity directions labels or weights, inverse mapping, isomorphism class, automorphism special case, invariants as filters and witness verification versus search complexity 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 Graph isomorphism. Graph isomorphism 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 two graph carriers and graph-type convention, vertex and edge sets, candidate vertex bijection, adjacency preservation in both directions, treatment of loops multiplicity directions labels or weights, inverse mapping, isomorphism class, automorphism special case, invariants as filters and witness verification versus search complexity 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, A candidate vertex bijection transports every incidence relation from one graph to the other; if both edges and nonedges correspond, relabeling by the map makes the adjacency structures identical., and type the carrier, state every parameter and convention in the definition, test that the two graph carriers and graph-type convention, vertex and edge sets, candidate vertex bijection, adjacency preservation in both directions, treatment of loops multiplicity directions labels or weights, inverse mapping, isomorphism class, automorphism special case, invariants as filters and witness verification versus search complexity are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Graph isomorphism Domain-specific

Parents (1) — outgoing typed relations

Graph isomorphism is a kind of Isomorphism Prime

It remains its own entry because its identity is fixed by the two graph carriers and graph-type convention, vertex and edge sets, candidate vertex bijection, adjacency preservation in both directions, treatment of loops multiplicity directions labels or weights, inverse mapping, isomorphism class, automorphism special case, invariants as filters and witness verification versus search complexity.

Hierarchy paths (4) — routes to 2 parentless roots

Graph isomorphism → is a kind of Isomorphism → is a kind of Bijectivity → is a kind of Function (Mapping)

Show alternative paths (3)

Neighborhood in Abstraction Space¶

Graph isomorphism 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