On large bipartite graphs of diameter 3

Ramiro Feria-Puron, Mirka Miller, Guillermo Pineda-Villavicencio

We consider the bipartite version of the {\it degree/diameter problem}, namely, given natural numbers $d\ge 2$ and $D\ge 2$, find the maximum number ${\mathbb{N}}^b(d,D)$ of vertices in a bipa…