Triangle graph
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]
| Triangle graph | |
|---|---|
 The triangle graph | |
| Vertices | 3 |
| Edges | 3 |
| Radius | 1 |
| Diameter | 1 |
| Girth | 3 |
| Automorphisms | 6 (D3) |
| Chromatic number | 3 |
| Chromatic index | 3 |
| Properties | 2-regular Vertex-transitive Edge-transitive Unit distance Hamiltonian Eulerian |
| Notation | or |
| Table of graphs and parameters | |
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
gollark: Also, it might be hard to match each disk drive to a door or whatever.
gollark: They have a 256-block limit or something, I think.
gollark: I guess.
gollark: And how would that be contacted?
gollark: You'd obviously need to store the random string somewhere all the keycard-supporting things could access it.
See also
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.