Wagner graph

The Wagner graph is a specific type of undirected graph that is notable in the study of graph theory. It has 12 vertices and 30 edges, and it is characterized by being both cubic (each vertex has a degree of 3) and 3-regular. One of the most interesting properties of the Wagner graph is that it is a non-planar graph, meaning it cannot be drawn on a plane without edges crossing.