GraphPower - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

Online Help

All Products    Maple    MapleSim


GraphTheory

  

GraphPower

  

construct graph power of a graph

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

GraphPower(G, k)

Parameters

G

-

unweighted graph

k

-

positive integer

Description

• 

GraphPower returns the kth graph power of a given graph. This is a graph in which two vertices are connected if there exists a path of length at most k in the original graph.

• 

The input graph G may be directed or undirected.

• 

The algorithm adds powers of the adjacency matrix of G and removes any multiple edges.

Examples

(1)

(2)

(3)

(4)

(5)

(6)

See Also

AdjacencyMatrix

Diameter

ShortestPath

 


Download Help Document