GraphPower returns the kth power graph of a given graph which may be directed or undirected. In the kth power graph, two vertices are connected if there exists a path of length at most k in the original graph.
The algorithm adds powers the adjacency matrix of G and removes any multiple edges.
P≔Graph 1: an undirected unweighted graph with 5 vertices and 4 edge(s)
P2≔Graph 2: an undirected unweighted graph with 5 vertices and 7 edge(s)
P3≔Graph 3: an undirected unweighted graph with 5 vertices and 9 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)