Lesson plan
Complete graph
{{Infobox graph | name = Complete graph | image = | image_caption = , a complete graph with 7 vertices | vertices = | radius = \left\{\begin{array}{ll}0 & n \le 1\\ 1 & \text{otherwise}\end{array}\right. | diameter = \left\{\begin{array}{ll}0 & n \le 1\\ 1 & \text{otherwise}\end{array}\right. | girth = \left\{\begin{array}{ll}\infty & n \le 2\\ 3 & \text{otherwise}\end{array}\right. | edges = \textstyle\frac{n(n - 1)}{2} |notation = | automorphisms = | chromatic_number = | chromatic_index = | spectrum = \left\{\begin{array}{lll}\emptyset & n = 0\\ \left\{0^1\right\} & n = 1\\ \left\{(n - 1)^1, -1^{n - 1}\right\} & \text{otherwise}\end{array}\right. | properties = }} In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction). Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete graphs, with their vertices placed on the points of a regular polygon, had already appeared in the 13th century, in the work of Ramon Llull. Such a drawing is sometimes referred to as a mystic rose.
Article summary
{{Infobox graph | name = Complete graph | image = | image_caption = , a complete graph with 7 vertices | vertices = | radius = \left\{\begin{array}{ll}0 & n \le 1\\ 1 & \text{otherwise}\end{array}\right. | diameter = \left\{\begin{array}{ll}0 & n \le 1\\ 1 & \text{otherwise}\end{array}\right. | girth = \left\{\begin{array}{ll}\infty & n \le 2\\ 3 & \text{otherwise}\end{array}\right. | edges = \textstyle\frac{n(n - 1)}{2} |notation = | automorphisms = | chromatic_number = | chromatic_index = | spectrum = \left\{\begin{array}{lll}\emptyset & n = 0\\ \left\{0^1\right\} & n = 1\\ \left\{(n - 1)^1, -1^{n - 1}\right\} & \text{otherwise}\end{array}\right. | properties = }} In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction). Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete graphs, with their vertices placed on the points of a regular polygon, had already appeared in the 13th century, in the work of Ramon Llull. Such a drawing is sometimes referred to as a mystic rose.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.