A construction of small regular bipartite graphs of girth 8ArticleAuthors: Camino Balbuena
1
0000-0003-4190-4287
Camino Balbuena
- 1 Departament de Matematica Aplicada III [Barcelona]
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.
Volume: Vol. 11 no. 2
Published on: January 1, 2009
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]