This is an old revision of the document!
Complete graph
Set
| $V,E$ … set |
| $ \langle V,E,\psi\rangle \in \mathrm{it}(E,V) $ |
| $ \langle V,E,\psi\rangle $ … simple graph |
| $ u,v \in V$ |
| $ u\neq v\implies \exists !(e\in E).\ \psi(e)=\{u,v\} $ |
Discussion
In a complete (undirected) graph, every two distinct vertices are connected.
The axiom $\{u\}\notin\mathrm{im}(\psi)$ says that there are no loops on a single vertex.
Reference
Wikipedia: Complete graph
Parents
Subset of
