In graph theory, an isomorphism between two graphs G and H is a bijection between their vertex sets that preserves adjacency, so it can be described as an edge-preserving bijection, following the general principle that isomorphisms preserve structure. Two graphs between which such a bijection exists are called isomorphic, and a bijection of this kind from a graph to itself is called an automorphism of that graph. Graph isomorphism is an equivalence relation on graphs, dividing all graphs into equivalence classes called isomorphism classes, and whether the graph isomorphism problem, deciding whether two graphs are isomorphic, can be solved in polynomial time is one of the major open questions in computer science. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Connections
In Branch
Source Graph Isomorphism (Wikipedia)
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Graph Isomorphism (Wikipedia)
- Lead section
In Branch: Graph Theory, Lead sentence
In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H f : V ( G ) → V ( H ) such tha
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.