Linked from

The 15 pages that link to Graph isomorphism, each with the reason it gives.

• Graph theoryRelated: It distinguishes structural sameness from differences in labels or drawings.

• Adjacency matrixRelated: Relabeling vertices permutes rows and columns without changing the represented graph.

• MultigraphRelated: For multigraphs, an isomorphism must preserve edge multiplicities.

• IsomorphismBroader topic: It captures the same structural idea using edges rather than algebraic operations.

• Line graphRelated: The construction can lose information: nonisomorphic graphs may have isomorphic line graphs.

• Burnside's lemmaRelated: Graph symmetries act on labelings, allowing orbit counts of distinct labeled forms.

• Equivalence classRelated: Graphs with the same structure can be grouped into classes under isomorphism.

• Graph embeddingCompared with: An isomorphism is an embedding onto the entire target, not merely into it.

• Fixed-parameter tractabilityRelated: Bounded-parameter variants illustrate how structural restrictions can simplify a difficult graph problem.

• Graph automorphismCompared with: Isomorphisms relate potentially different graphs; automorphisms are self-isomorphisms.

• Petersen graphRelated: The Petersen graph serves as a recognizable benchmark when comparing graph representations and algorithms.

• Graph homomorphismCompared with: Unlike a homomorphism, an isomorphism cannot collapse vertices and must preserve nonedges.

• Graph isomorphism problemNarrower topic: The problem asks whether this relation holds for a given pair of graphs.

• Spectral graph theoryRelated: Spectral invariants can rule out isomorphism, though cospectral graphs limit their power.

• Graph structure theoremRelated: Minor-structure methods contribute to algorithms for isomorphism on restricted graph classes.