On bipartite biregular large graphs
Combinatorics
2024-04-09 v1
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 . Moreover, we find some biMoore graphs, that is, bipartite biregular graphs that attain the Moore bound.
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}
}