DOAJ
Open Access
2009
A construction of small regular bipartite graphs of girth 8
Camino Balbuena
Abstrak
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.
Topik & Kata Kunci
Penulis (1)
C
Camino Balbuena
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2009
- Sumber Database
- DOAJ
- DOI
- 10.46298/dmtcs.461
- Akses
- Open Access ✓