Triangle graph

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Triangle graph
Complete graph K3.svg
The triangle graph
Vertices3
Edges3
Radius1
Diameter1
Girth3
Automorphisms6 (D3)
Chromatic number3
Chromatic index3
Properties2-regular
Vertex-transitive
Edge-transitive
Unit distance
Hamiltonian
Eulerian
Notation or
Table of graphs and parameters

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 and the complete graph .

Properties[edit]

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

See also[edit]

References[edit]

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