| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
A construction of small regular bipartite graphs of girth 8
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.
Cited literature [25 references]
https://hal.inria.fr/hal-00988211
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, May 7, 2014 - 3:58:30 PM
Last modification on : Monday, November 16, 2020 - 3:56:03 PM
Long-term archiving on: : Thursday, August 7, 2014 - 11:40:12 AM
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, May 7, 2014 - 3:58:30 PM
Last modification on : Monday, November 16, 2020 - 3:56:03 PM
Long-term archiving on: : Thursday, August 7, 2014 - 11:40:12 AM
File
710-4299-1-PB.pdf
Files produced by the author(s)