Difference between revisions of "Complete graph"
From Encyclopedia of Mathematics
(Start article: Complete graph) |
(svg image) |
||
| Line 4: | Line 4: | ||
The undirected [[graph]] on a vertex set $\{v_1,\ldots,v_n\}$ in which any two distinct vertices are joined by an edge: denoted $K_n$. | The undirected [[graph]] on a vertex set $\{v_1,\ldots,v_n\}$ in which any two distinct vertices are joined by an edge: denoted $K_n$. | ||
| + | |||
| + | [[File:Complete graph K5.svg|center|200px|Complete graph K5]] | ||
A [[tournament]] is a directed graph whose underlying undirected graph is complete. | A [[tournament]] is a directed graph whose underlying undirected graph is complete. | ||
Latest revision as of 16:45, 16 March 2023
2020 Mathematics Subject Classification: Primary: 05C [MSN][ZBL]
on $n$ vertices
The undirected graph on a vertex set $\{v_1,\ldots,v_n\}$ in which any two distinct vertices are joined by an edge: denoted $K_n$.
A tournament is a directed graph whose underlying undirected graph is complete.
How to Cite This Entry:
Complete graph. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Complete_graph&oldid=37076
Complete graph. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Complete_graph&oldid=37076