{"docId":461,"paperId":461,"url":"https:\/\/dmtcs.episciences.org\/461","doi":"10.46298\/dmtcs.461","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":87,"name":"Vol. 11 no. 2"}],"section":[],"repositoryName":"Hal","repositoryIdentifier":"hal-00988211","repositoryVersion":1,"repositoryLink":"https:\/\/hal.science\/hal-00988211v1","dateSubmitted":"2015-03-26 16:20:24","dateAccepted":"2015-06-09 14:47:13","datePublished":"2009-01-01 08:00:00","titles":{"en":"A construction of small regular bipartite graphs of girth 8"},"authors":["Balbuena, Camino"],"abstracts":{"en":"Let q be a prime a power and k an integer such that 3 \u2264 k \u2264 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."},"keywords":["[INFO.INFO-DM] Computer Science [cs]\/Discrete Mathematics [cs.DM]"]}