Abstract
A bipartite graph G=(V,E) with V=V1∪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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
