Editing Klein four-group (section)

== Graph theory ==
Among the [[simple graph|simple]] [[connected graph]]s, the simplest (in the sense of having the fewest entities) that admits the Klein four-group as its [[graph automorphism|automorphism group]] is the [[diamond graph]] shown below.  It is also the automorphism group of some other graphs that are simpler in the sense of having fewer entities.  These include the graph with four vertices and one edge, which remains simple but loses connectivity, and the graph with two vertices connected to each other by two edges, which remains connected but loses simplicity.

{{multiple image|align = center|perrow = 3
| image1 = Diamond graph.svg  | width1=150 | height1=150
| image2 = Klein 4-Group Graph.svg  | width2=150 | height2=150
| image3 = Digon graph.svg | width3=338 | height3=150
}}