From Surf Wiki (app.surf) — the open knowledge base
Triangle graph
| Field | Value | |
|---|---|---|
| name | Triangle graph | |
| image | [[Image:Complete_graph_K3.svg | 160px]] |
| 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 | C_3 or K_3 | |
| properties | 2-regular | |
| Vertex-transitive | ||
| Edge-transitive | ||
| Unit distance | ||
| Hamiltonian | ||
| Eulerian |
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.
The triangle graph is also known as the cycle graph C_3 and the complete graph K_3.
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 (x-2)(x-1)x.
References
References
- "Triangle Graph".
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Triangle graph — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report