Ask Math Problems

126 readers

1 users here now

founded 2 years ago

MODERATORS

MagneticElectron

Graph isomorphism (sopuli.xyz)

submitted 2 years ago* (last edited 2 years ago) by Sibbo@sopuli.xyz to c/askmath

7 comments fedilink hide all child comments

Definitions

A graph G = (V, E) is a set of nodes V and a set of undirected edges E. An undirected edge is a set of two vertices.

Two graphs G1 = (V1, E1) and G2 = (V2, E2) are isomorph if there is a bijective mapping f from V1 to V2 such that f(E1) = E2. Applying f to E1 means applying it to each node in each edge in E1.

Problem

Is there an algorithm that decides if two arbitrary graphs are isomorphic in polynomial time?

you are viewing a single comment's thread
view the rest of the comments

[–] MBM 3 points 2 years ago (1 children)

Unless I'm reading your question wrong, it's an open question so nobody knows

[–] Sibbo@sopuli.xyz -1 points 2 years ago

That's why I'm asking