Log in

www.springer.com The European Mathematical Society

Tools

View source for Complete graph

← Complete graph

Jump to: navigation, search

You do not have permission to edit this page, for the following reasons:

The action you have requested is limited to users in the group: Users.
You must confirm your email address before editing pages. Please set and validate your email address through your user preferences.

You can view and copy the source of this page.

{{TEX|done}}{{MSC|05C}}

''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$.

[[File:Complete graph K5.svg|center|200px|Complete graph K5]]

A [[tournament]] is a directed graph whose underlying undirected graph is complete.

Templates used on this page:

Return to Complete graph.

How to Cite This Entry:
Complete graph. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Complete_graph&oldid=52698

Retrieved from "https://encyclopediaofmath.org/wiki/Complete_graph"