Let 2 6 r < m and g be positive integers. An ({r,m}; g)–graph (or biregular graph) is a graph with degree set {r,m} and girth g, and an ({r,m}; g)–cage (or biregular cage) is an ({r,m}; g)–graph of… (More)

Let 2 ≤ r < m and g be positive integers. An ({r,m}; g)–graph (or biregular graph) is a graph with degree set {r,m} and girth g, and an ({r,m}; g)–cage (or biregular cage) is an ({r,m}; g)–graph of… (More)

Let 2 ≤ r < m and g ≥ 4 even be three positive integers. A graph with a degree set {r,m}, girth g and minimum order is called a bi-regular cage or an ({r,m}; g)-cage, and its order is denoted by… (More)