# Finite simple undirected graphs

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

[Catalogue presentation and source-binding data](https://ocme.evemisslab.com/data/i18n/catalogue.en.json)



## [Finite simple undirected graphs](https://ocme.evemisslab.com/en/atlas/atlas-graph/)

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

[Finite simple undirected graphs](https://ocme.evemisslab.com/en/mko/mko-graph/)

## Prerequisite nodes


- [Set](https://ocme.evemisslab.com/en/atlas/atlas-set/)
- [Binary relations and set projections](https://ocme.evemisslab.com/en/atlas/atlas-relation/)