10.46298/dmtcs.461
https://dmtcs.episciences.org/461
Balbuena, Camino
Camino
Balbuena
A construction of small regular bipartite graphs of girth 8
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.
episciences.org
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
2015-06-09
2009-01-01
2009-01-01
en
journal article
https://hal.science/hal-00988211v1
1365-8050
https://dmtcs.episciences.org/461/pdf
VoR
application/pdf
Discrete Mathematics & Theoretical Computer Science
Vol. 11 no. 2
Researchers
Students