|
GraphTheory[CompleteGraph]
|
|
Calling Sequence
|
|
CompleteGraph(n)
CompleteGraph(V)
CompleteGraph(n, m)
CompleteGraph(n1, n2,..., nk)
|
|
|
Parameters
|
|
|
n, m
|
-
|
positive integers
|
|
n1,...,nk
|
-
|
positive integers
|
|
V
|
-
|
list of integers, strings or symbols (vertex labels)
|
|
|
|
|
|
Description
|
|
|
•
|
CompleteGraph(n) returns the complete graph on n vertices. CompleteGraph(V) does the same thing except the vertices are labeled using the entries of V.
|
|
•
|
CompleteGraph(n, m) returns the complete bipartite graph with bipartitions of size n and m.
|
|
•
|
CompleteGraph(n1,...,nk) returns the complete multipartite graph with partitions of size n1,..., nk.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
>
|
|
|
| (3) |
|
>
|
|
|
| (4) |
|
>
|
|
|
|
Download Help Document
Was this information helpful?
