Abstract Algebra: Theory and Applications · Problem 14.9.6

The Sylow Theorems — Thomas Judson

Mathematics — Abstract Algebra · cycle-graph-automorphism-stabilizers

Problem

Build the graph given by the commands below. The result should be a symmetric-looking graph with an automorphism group of order 16. \begin{verbatim} G = graphs.CycleGraph(8) G.add_edges([(0,2),(1,3),(4,6),(5,7)]) G.plot() \end{verbatim} Repeat the two parts of the previous exercise, but realize that in the second part there are now two different stabilizers to create, so build both and compare the differences in the stabilizers and their orbits. Creating a second plot with G.plot(layout='planar') might provide extra insight.

Browse the problem library