GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


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

GraphTheory

  

GraphJoin

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

GraphJoin(G, H)

Parameters

G, H

-

graphs

Description

• 

The GraphJoin(G,H) function returns the graph which is obtained by connecting all the vertices of G to all vertices of H. The vertex labels in the resulting graph are strings of the form "1:u" and "2:v" where u is a vertex in G and v is a vertex in H.

Examples

withGraphTheory:

GGraphJoinPathGraph2,Graph3

GGraph 1: an undirected unweighted graph with 5 vertices and 7 edge(s)

(1)

VerticesG

1:1,1:2,2:1,2:2,2:3

(2)

EdgesG

1:1,1:2,1:1,2:1,1:1,2:2,1:1,2:3,1:2,2:1,1:2,2:2,1:2,2:3

(3)

See Also

CartesianProduct

DisjointUnion

GraphUnion