Triangle graph: Difference between revisions
Appearance
Content deleted Content added
m Bot: Migrating 1 interwiki links, now provided by Wikidata on d:Q3115619 |
No edit summary |
||
Line 21: | Line 21: | ||
Its chromatic polynomial is : <math>(x-3)(x-2)x</math> |
Its chromatic polynomial is : <math>(x-3)(x-2)x</math> |
||
==See also== |
|||
* [[Triangle-free graph]] |
|||
== References == |
== References == |
Revision as of 06:25, 4 March 2015
Triangle graph | |
---|---|
![]() The triangle graph | |
Vertices | 3 |
Edges | 3 |
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 |
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
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 :