Triangle graph
From Wikipedia, the free encyclopedia
From Wikipedia, the free encyclopedia
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]
This article relies largely or entirely on a single source. (July 2024) |
Triangle graph | |
---|---|
Vertices | 3 |
Edges | 3 |
Radius | 1 |
Diameter | 1 |
Girth | 3 |
Automorphisms | 6 (D3) |
Chromatic number | 3 |
Chromatic index | 3 |
Properties | 2-regular Vertex-transitive Edge-transitive Unit distance Hamiltonian Eulerian |
Notation | or |
Table of graphs and parameters |
The triangle graph is also known as the cycle graph and the complete graph .
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
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.