A \((k;g)\)-cage is a graph with the minimum order among all \(k\)-regular graphs with girth \(g\). As a special family of graphs, \((k;g)\)-cages have a number of interesting properties. In this paper, we investigate various properties of cages, e.g., connectivity, the density of shortest cycles, bricks and braces.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.