Work

On Bipartite Biregular Large Graphs Derived From Difference Sets

Year: 2025
Type: article
Abstract: ABSTRACT A bipartite graph with is biregular if all the vertices of each stable set, and , have the same degree, and , respectively. This paper studies difference sets derived from both Abelian and non‐Abelian groups. From them, we propose some constructions of bipartite biregular graphs with diameter and asymptotically optimal order for given degrees and , meaning that asymptotically the order approaches a fixed multiple of the Moore bound. Moreover, we find some biMoore graphs, that is, bipartite biregular graphs that attain the Moore bound.
Language: English
Open Access status: hybrid
Estimated APC paid: $4,150
OpenAlex ID: W4410784149
FWCI:
Cites: 6
Cited by:
Related to: 10