English

On bipartite biregular large graphs

Combinatorics 2024-04-09 v1

Abstract

A bipartite graph G=(V,E)G=(V,E) with V=V1V2V=V_1\cup V_2 is biregular if all the vertices of each stable set, V1V_1 and V2V_2, have the same degree, rr and ss, 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 d=3d=3 and asymptotically optimal order for given degrees rr and ss. Moreover, we find some biMoore graphs, that is, bipartite biregular graphs that attain the Moore bound.

Keywords

Cite

@article{arxiv.2404.04680,
  title  = {On bipartite biregular large graphs},
  author = {G. Araujo-Pardo and C. Dalfó and M. A. Fiol and N. López},
  journal= {arXiv preprint arXiv:2404.04680},
  year   = {2024}
}
R2 v1 2026-06-28T15:46:01.575Z