cage

A (v, g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a (3, g)-cage. A list of cage graphs can be obtained in the Wolfram Language using GraphData["Cage"]. There are a number of special cases. The (2, g)-cage is the cycle graph C_g, the (v, 2)-cage is the multigraph of v edges on two vertices, the (v, 3)-cage is the complete graph K_(v + 1), and the (v, 4)-cage is the bipartite graph K_(v, v).

Balaban 10-cage | Cayley graph | cubic graph | excess | Foster cage | Harries graph | Harries-Wong graph | Heawood graph | Hoffman-Singleton graph | McGee graph | Meringer graph | Moore graph | Petersen graph | regular graph | Robertson graph | Robertson-Wegner graph | Tutte 8-cage | Wong graph