- Properties
- See also
- References
| name = Triangle graph
| image =
| image_caption = The triangle graph
| vertices = 3
| edges = 3
| automorphisms = 6 (D3)
| chromatic_number = 3
| chromatic_index = 3
| diameter = 1
| radius = 1
| girth = 3
| notation =
or 
| 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.[1]
The triangle graph is also known as the cycle graph and the complete graph .
Properties
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 
See also
- Triangle-free graph
References
1. ^{{MathWorld|urlname=TriangleGraph|title=Triangle Graph}}
2 : Individual graphs|Regular graphs
- Jaroslav Findejs
- Jaroslav Fragner
- Jaroslav Goll
- Jaroslav Hynek
- Jaroslav Hübl (ice hockey b. 1957)
- Jaroslav Hübl (ice hockey b. 1982)
- Jaroslav Janda
- Jaroslav Jerabek
- Jaroslav Jeřábek
- Jaroslav Jilek
- Jaroslav Jiranek
- Jaroslav Jirasek
- Jaroslav Jirásek
- Jaroslav Jílek
- Jaroslav Jílek (table tennis)
- Jaroslav Kanturek
- Jaroslav Kantůrek
- Jaroslav Kasprisin
- Jaroslav Knotek
- Jaroslav Konecny (boxer)
- Jaroslav Konečný (boxer)
- Jaroslav Kopet
- Jaroslav Kopriva
- Jaroslav Kopřiva
- Jaroslav Koran