A construction of small regular bipartite graphs of girth 8

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/9455

Title:	A construction of small regular bipartite graphs of girth 8
Author:	Balbuena Martínez, Maria Camino Teófila
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III; Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
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(kq^{2}-q)$ vertices. Some of these graphs have the smallest number of vertices among the known regular graphs with girth 8.
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs -Magic squares -Cages -Graph theory -Matrices -Quadrats màgics -Grafs, Teoria de -Matrius (Matemàtica)
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Published version Article
Share: