Triangle graph: Difference between revisions
No edit summary |
|||
| Line 8: | Line 8: | ||
# It is the [[cycle graph]] on 3 vertices, and is denoted <math>C_3</math>. | # It is the [[cycle graph]] on 3 vertices, and is denoted <math>C_3</math>. | ||
# It is the [[complete graph]] on 3 vertices, and is denoted <math>K_3</math>. | # It is the [[complete graph]] on 3 vertices, and is denoted <math>K_3</math>. | ||
# It is the [[odd graph]] <math>O_2</math>, i.e., the [[Kneser graph]] <math>KG_{3,1}</math>. | |||
Revision as of 03:35, 29 May 2012
This article defines a particular undirected graph, i.e., the definition here determines the graph uniquely up to graph isomorphism.
View a complete list of particular undirected graphs
Definition
This is a particular finite undirected graph defined as follows:
- It is a graph whose geometric realization is a triangle: it has three vertices and an edge between each pair of vertices.
- It is the cycle graph on 3 vertices, and is denoted .
- It is the complete graph on 3 vertices, and is denoted .
- It is the odd graph , i.e., the Kneser graph .
