Biregular graph¶

A bipartite graph in which all vertices on each side have one common degree, with the two sides allowed different degrees.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3481
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Graph Theory → Mathematics
Aliases: Semiregular bipartite graph

Core Idea¶

For bipartition U and V, every U vertex has degree x and every V vertex degree y, forcing x times the size of U to equal y times the size of V by double counting edges. The bipartition separates two vertex roles, uniform incidence on each side imposes two local degree constraints and shared edge counting produces a global cardinality relation. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Kids and Balloons Strings

Imagine a group of kids and a bunch of balloons, and strings only ever go from a kid to a balloon. Every kid holds exactly 2 strings, and every balloon has exactly 3 strings tied to it. That is a Biregular graph. Because every string has a kid at one end and a balloon at the other, counting strings by kids or by balloons gives the same total.

Two Teams, Fixed Connections

A graph is a set of dots connected by lines. In a Biregular graph, the dots are split into two groups, and lines only go between the groups, never inside one. Every dot in the first group has the same number of lines, say x, and every dot in the second group has the same number, say y. Because each line has one end in each group, counting the lines from either side must give the same total. So x times the size of the first group equals y times the size of the second group. For example, if every dot in group A has 2 lines and there are 3 dots in A, there are 6 lines, so if each dot in B has 3 lines, B must have 2 dots.

Two-Sided Uniform Degree Graph

A Biregular graph is a bipartite graph, with vertex sets U and V and every edge running between them, in which all vertices in U have the same degree x and all vertices in V have the same degree y. It's a two-sided version of a regular graph, where every vertex has the same degree. Counting edges two ways, once from the U side and once from the V side, gives the identity x·|U| = y·|V|. That means the degrees and side sizes can't be chosen independently. A regular bipartite graph is the special case where x = y, which then forces the two sides to be the same size. When checking whether a graph is biregular, you have to specify which bipartition you mean and how isolated vertices, which have degree 0, are handled.

A Biregular graph (more precisely, an (x, y)-biregular graph) is a bipartite graph with a chosen bipartition (U, V) in which every vertex of U has degree x and every vertex of V has degree y. The bipartition separates two vertex roles, and the uniformity of incidence on each side imposes two local degree constraints. Double counting the edges, as the sum of degrees over U and as the sum over V, yields the global cardinality relation x|U| = y|V|, so side sizes are forced into the ratio y : x. Precise statements must fix the bipartition, since a disconnected bipartite graph can admit more than one, and must say how isolated vertices are treated, since a degree-zero vertex breaks uniformity on its side unless x or y is zero. Checking the definition means verifying the bipartite structure, confirming degree uniformity on each side, and checking the edge-count identity. Regular bipartite graphs are the case x = y.

Scope of Application¶

Biregular graph belongs to graph theory and is useful where the analyst can specify the typed graph theory carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the graph and chosen bipartition, absence or treatment of isolated vertices, side degrees x and y, verification of uniformity and the edge-count identity are explicit. The scope is broad within that domain but bounded by the need for the graph and chosen bipartition, absence or treatment of isolated vertices, side degrees x and y, verification of uniformity and the edge-count identity are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the graph and chosen bipartition, absence or treatment of isolated vertices, side degrees x and y, verification of uniformity and the edge-count identity are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Biregular graph can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Biregular graph. Biregular graph compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed graph theory carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the graph and chosen bipartition, absence or treatment of isolated vertices, side degrees x and y, verification of uniformity and the edge-count identity are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of graph theory because they reuse the typed graph theory carrier, including its objects, relations, parameters, conventions, evidence, boundary cases, and comparison targets, The bipartition separates two vertex roles, uniform incidence on each side imposes two local degree constraints and shared edge counting produces a global cardinality relation., and type the carrier, state every parameter and convention in the definition, test that the graph and chosen bipartition, absence or treatment of isolated vertices, side degrees x and y, verification of uniformity and the edge-count identity are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Biregular graph Domain-specific

Parents (1) — outgoing typed relations

Biregular graph is a kind of Symmetry Prime

It remains its own entry because its identity is fixed by the graph and chosen bipartition, absence or treatment of isolated vertices, side degrees x and y, verification of uniformity and the edge-count identity.

Children (1) — abstractions linked here by typed relations

Complete Bipartite Graph Domain-specific is a kind of Biregular graph

K_{m,n} has uniform degree n on one side and m on the other, strictly specializing a biregular bipartite graph.

Hierarchy path (1) — routes to 1 parentless root

Biregular graph → is a kind of Symmetry

Neighborhood in Abstraction Space¶

Biregular graph sits in a crowded region of the domain-specific corpus (0^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Graph Theory Structures & Invariants (48 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25