Abstract : 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://hal.inria.fr/hal-00988211
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : mercredi 7 mai 2014 - 15:58:30
Dernière modification le : mercredi 29 novembre 2017 - 10:26:17
Document(s) archivé(s) le : jeudi 7 août 2014 - 11:40:12
Camino Balbuena. A construction of small regular bipartite graphs of girth 8. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2009, 11 (2), pp.33--46. 〈hal-00988211〉
