Bipartite biregular Moore graphs
MetadataShow full item record
A bipartite graph G=(V,E) with V=V1 U V2 is biregular if all the vertices of a stable set Vi have the same degree ri for i=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àbrega. Besides, we propose some constructions of bipartite biregular graphs with diameter d and large number of vertices N(r1,r2;d), together with their spectra. In some cases of diameters d=3, 4, and 5, the new graphs attaining the Moore bound are unique up to isomorphism.