ART

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]

Complete graph K3

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 \( {\displaystyle (x-2)(x-1)x.} \)
See also

Triangle-free graph

References

Weisstein, Eric W. "Triangle Graph". MathWorld.

Undergraduate Texts in Mathematics

Graduate Texts in Mathematics

Graduate Studies in Mathematics

Mathematics Encyclopedia

World

Index

Hellenica World - Scientific Library

Retrieved from "http://en.wikipedia.org/"
All text is available under the terms of the GNU Free Documentation License