eng
episciences.org
Discrete Mathematics & Theoretical Computer Science
1365-8050
2009-01-01
Vol. 11 no. 2
10.46298/dmtcs.461
461
journal article
A construction of small regular bipartite graphs of girth 8
Camino Balbuena
Let q be a prime a power and k an integer such that 3 ≤ k ≤ q. In this paper we present a method using Latin squares to construct adjacency matrices of k-regular bipartite graphs of girth 8 on 2(kq2 -- q) vertices. Some of these graphs have the smallest number of vertices among the known regular graphs with girth 8.
https://dmtcs.episciences.org/461/pdf
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]