Triangle graph

Triangle graph
vertices = 3
edges = 3
automorphisms = 6 ( D ₃ )
chromatic number = 3
chromatic index = 3
girth = 3
designation =

C_{3}

{\ displaystyle C_ {3}}

C_ {3}

or

K_{3}

{\ displaystyle K_ {3}}

K_ {3}

properties =
2 regular
vertex-transitive
edge-transitive
unit distance graph
hamilton
Euler

In graph theory, a triangular graph is a planar undirected graph with three vertices and three edges forming a triangle ^[1] .

A triangle graph is also known as a cycle graph. $C_{3}$ ${\ displaystyle C_ {3}}$ $C_ {3}$ and complete graph $K_{3}$ ${\ displaystyle K_ {3}}$ $K_ {3}$ .

Properties

The triangular graph has a chromatic number 3, a chromatic index 3, a radius of 1, a diameter of 1, and a girth of 3. It is also 2- vertex connected and 2 -edge connected .

The chromatic polynomial of a graph is equal to $(x-3)(x-2)x$ ${\ displaystyle (x-3) (x-2) x}$ .

Notes

↑ Weisstein, Eric W. Triangle Graph on Wolfram MathWorld .

[1] Weisstein, Eric W. Triangle Graph on Wolfram MathWorld .

Triangle graph

Properties

Notes

More articles: