Bipartite biregular Moore graphs
Combinatorics
2021-03-23 v1
Abstract
A bipartite graph with is biregular if all the vertices of a stable set have the same degree for . 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 and large number of vertices , together with their spectra. In some cases of diameters , , and , 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