Finite simple undirected graphs

This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.

This entry covers finite simple undirected graphs. An edge is an unordered set of two distinct vertices, and degree counts distinct neighbors.

atlas-graph · canonical_mko

Prerequisite nodes