Triangle graph

This article defines a particular undirected graph, i.e., the definition here determines the graph uniquely up to graph isomorphism.
View a complete list of particular undirected graphs

Definition

This is a particular finite undirected graph defined as follows:

1. It is a graph whose geometric realization is a triangle: it has three vertices and an edge between each pair of vertices.
2. It is the cycle graph on 3 vertices, and is denoted $C_{3}$.
3. It is the complete graph on 3 vertices, and is denoted $K_{3}$.