On Bipartite Biregular Large Graphs Derived From Difference Sets
A bipartite graph G = ( V , E ) with V = V 1 boolean OR V 2 is biregular if all the vertices of each stable set, V 1 and V 2 , have the same degree, r and s, respectively. This paper studies difference sets derived from both Abelian and non-Abelian groups. From them, we propose some constructions of...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2025 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10459.1/468068 |
| Acceso en línea: | https://doi.org/10.1002/jgt.23263 https://hdl.handle.net/10459.1/468068 |
| Access Level: | acceso abierto |
| Palabra clave: | Adjacency spectrum Bipartite biregular graphs Diameter Moore bound |
| Sumario: | A bipartite graph G = ( V , E ) with V = V 1 boolean OR V 2 is biregular if all the vertices of each stable set, V 1 and V 2 , have the same degree, r and s, 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 d = 3 and asymptotically optimal order for given degrees r and s, meaning that asymptotically the order approaches a fixed multiple of the Moore bound. Moreover, we find some biMoore graphs, that is, bipartite biregular graphs that attain the Moore bound. |
|---|