A wheel graph is a cycle graph on n-1 vertices with an extra single vertex adjacent to every vertex in the cycle.
i1 : G = wheelGraph 6
o1 = Graph{0 => {1, 2, 3, 4, 5}}
1 => {0, 2, 5}
2 => {0, 1, 3}
3 => {0, 2, 4}
4 => {0, 3, 5}
5 => {0, 1, 4}
o1 : Graph
|
The object wheelGraph is a method function.