complete graph

In the mathematical field of graph theory a complete graph is a simple graph where an edge connects every pair of vertices. The complete graph on $n$ vertices has

n

vertices and

n(n-1)/2

edges, and is denoted by

K_n

. It is a regular graph of degree

n-1

. All complete graphs are their own cliques. They are maximally connected as the only vertex cut which disconnects the graph is the complete set of vertices. A planar graph cannot contain

K_5

(or the complete bipartite graph

K_{3,3}

) as a minor. Complete graphs on

n

vertices, for

n

between 1 and 8, are shown below:

<< Previous

Word Browser

Next >>

turan
uni
vanth
veive
voltumna
catherine of alexandria
ring magazine
julia margaret cameron
cyrene, libya
stoma
reduced mass

royal society of arts
leave
knud jeppesen
lah number
orbital maneuvering system
phonon
trans lunar injection
devonport leat
theodor mommsen
class warfare
penet remailer

dead air
pseudonymous remailer
kazimierz pulaski
junianus justinus
nibelungenlied
john olerud
regular graph
erik the red
amphiuma
thorvald asvaldsson
bastard sword

list of celtic mythological beings
abandinus
dietrich von bern
halfdan the black
john anderson
milton s. hershey
abarta
abellio
abhean
abnoba
achall