GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/CompleteGraph

GraphTheory

  

CompleteGraph

 

Calling Sequence

Parameters

Description

Examples

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

withGraphTheory:

K4CompleteGraph4

K4:=Graph 1: an undirected unweighted graph with 4 vertices and 6 edge(s)

(1)

EdgesK4

1,2,1,3,1,4,2,3,2,4,3,4

(2)

DrawGraphK4

K23CompleteGraph2,3

K23:=Graph 2: an undirected unweighted graph with 5 vertices and 6 edge(s)

(3)

EdgesK23

1,3,1,4,1,5,2,3,2,4,2,5

(4)

DrawGraphK23,style=bipartite

See Also

DrawGraph

Edges

Graph

IsBipartite

 


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam