| Triangle graph | |
| Vertices: | 3 |
| Edges: | 3 |
| Automorphisms: | 6 (D3) |
| Chromatic Number: | 3 |
| Chromatic Index: | 3 |
| Diameter: | 1 |
| Radius: | 1 |
| Girth: | 3 |
| Notation: | C3 K3 |
| Properties: | 2-regular Vertex-transitive Edge-transitive Unit distance Hamiltonian Eulerian |
In the mathematical field of graph theory, the triangle graph is a planar undirected graph with 3 vertices and 3 edges, in the form of a triangle.
C3
K3
The triangle graph has chromatic number 3, chromatic index 3, radius 1, diameter 1 and girth 3. It is also a 2-vertex-connected graph and a 2-edge-connected graph.
Its chromatic polynomial is
(x-2)(x-1)x.