In graph theory, a **cage** is a special type of graph that is defined by certain properties related to its vertices and edges. Specifically, a cage is a regular graph (a graph where each vertex has the same degree) with the fewest number of edges for a given degree and a specified girth (the length of the shortest cycle in the graph).
Articles by others on the same topic
There are currently no matching articles.