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 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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 C3 and the complete graph K3.
Properties
edit edit sourceThe 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.
See also
edit edit sourceReferences
edit edit source- ^ Weisstein, Eric W. "Triangle Graph". MathWorld. Wikipedia revision 1233215519, retrieved 2026-11-18
Text derived from https://en.wikipedia.org/w/index.php?oldid=1233215519 under CC BY-SA 4.0; modifications have been made.