-Closure of a Directed -Cycle Graph
Initializing live version
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
The -closure of a digraph is a digraph with the same vertex set as and an arc set that is the set of arcs where and are vertices of such that there is a -path in of length less than or equal to .
[more]
Contributed by: Sebastian Gonzalez Hermosillo de la Maza (December 2011)
Open content licensed under CC BY-NC-SA
Snapshots
Details
Permanent Citation