This is a pair of earrings highlighting the complete bipartite graph with six vertices (K_{3,3}). Notice that every corner on the left is connected via a path to every corner of the right. While K_{3,3} is a nonplanar graph, these earrings are elegant noncrossing three-dimensional embeddings.
Together with the complete graph K_5, they form a set of forbidden subgraphs to determine when a graph can be drawn on paper without crossings. This is known as Kuratowski's Theorem.
You may prefer a pair of these two
Forbidden Subgraph Earrings.
Or a matching pair of
Complete Graph Earrings.
Aspiring Graph Theorists will also be interested in the matching Petersen Graph Pendant.