Ingraph-theoretic mathematics, a biregular graph[1]orsemiregular bipartite graph[2] is a bipartite graph for which every two vertices on the same side of the given bipartition have the same degree as each other. If the degree of the vertices in is and the degree of the vertices in is, then the graph is said to be -biregular.
An-biregular graph must satisfy the equation . This follows from a simple double counting argument: the number of endpoints of edges in is, the number of endpoints of edges in is, and each edge contributes the same amount (one) to both numbers.
^Scheinerman, Edward R.; Ullman, Daniel H. (1997), Fractional graph theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York: John Wiley & Sons Inc., p. 137, ISBN0-471-17864-0, MR1481157.
^Gropp, Harald (2007), "VI.7 Configurations", in Colbourn, Charles J.; Dinitz, Jeffrey H. (eds.), Handbook of combinatorial designs, Discrete Mathematics and its Applications (Boca Raton) (Second ed.), Chapman & Hall/CRC, Boca Raton, Florida, pp. 353–355.