Complete graph
Simple undirected graph in which every pair of distinct vertices is connected by a unique edge
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).
Nº Q45715 ★
Common · Knowledge
Complete graph
Simple undirected graph in which every pair of distinct vertices is connected by a unique edge
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).
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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.
Text: Wikipédia, CC BY-SA 4.0. · Image: Michel Bakni (CC BY-SA 4.0) ·
Related cards
Graph theory
Study of graphs, which are mathematical structures used to model pairwise relations between objects
Nº Q131476 ★★★★
Strongly regular graph
Graph in which the number of shared neighbors of two vertices depends only on whether they are adjacent
Nº Q692823 ★
Ramsey's theorem
Combinatorics theorem that any edge labeling of a sufficiently large complete graph contains monochromatic cliques
Nº Q918099 ★★
Kőnig's theorem (graph theory)
Theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs
Nº Q897769 ★
Graph drawing
Visualization of node-link graphs
Nº Q739462 ★
Spectral graph theory
The study of the properties of a graph in relationship to matrices associated with the graph
Nº Q3180727 ★