In the mathematical field of graph theory, a cage is a regular graph that has as few vertices as possible for its girth. Formally, an (r, g)-graph is defined to be a graph in which each vertex has exactly r neighbors, and in which the shortest cycle has a length of exactly g.
In the mathematical field of graph theory, a cage is a regular graph that has as few vertices as possible for its girth. Formally, an (r, g)-graph is defined to be a graph in which each vertex has exactly r neighbors, and in which the shortest cycle has a length of exactly g.
Source: Wikipedia "Cage (graph theory)" · CC BY-SA 4.0
Share this article: X · Bluesky