English

Bipartite biregular Moore graphs

Combinatorics 2021-03-23 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 a stable set ViV_i have the same degree rir_i for i=1,2i=1,2. In this paper, we give an improved new Moore bound for an infinite family of such graphs with odd diameter. This problem was introduced in 1983 by Yebra, Fiol, and F\`abrega.\\ Besides, we propose some constructions of bipartite biregular graphs with diameter dd and large number of vertices N(r1,r2;d)N(r_1,r_2;d), together with their spectra. In some cases of diameters d=3d=3, 44, and 55, the new graphs attaining the Moore bound are unique up to isomorphism.

Keywords

Cite

@article{arxiv.2103.11443,
  title  = {Bipartite biregular Moore graphs},
  author = {Gabriela Araujo-Pardo and Cristina Dalfó and Miguel Ángel Fiol and Nacho López},
  journal= {arXiv preprint arXiv:2103.11443},
  year   = {2021}
}

Comments

19 pages, 2 figures

R2 v1 2026-06-24T00:23:57.156Z