CycleBasis returns a list of cycles in the graph, with each cycle represented as a list of vertices. These cycles form a basis for the cycle space of G, so that every other cycle in G can be obtained from the cycle basis using only symmetric differences.
The elements of the basis are also known as fundamental cycles.
The number of elements in the cycle basis (i.e., the dimension of the cycle space) is called the cyclomatic number of G.
The algorithm starts from a spanning tree of G and computes fundamental cycles for each graph obtained by adding one of the remaining edges of G to the spanning tree.
Calculate and show the cycle basis of a wheel graph.
G ≔ WheelGraph⁡5:
Cycles ≔ CycleBasis⁡G
Cycles ≔ 0,1,2,0,1,5,0,2,3,0,3,4,0,4,5
Calculate the cycle basis of the octahedron graph.
G ≔ OctahedronGraph⁡:
Cycles ≔ 1,3,2,4,1,3,2,5,1,3,2,6,1,3,5,1,3,6,1,4,5,1,4,6
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.