On certain regular graphs of girth 5
type: Item
instance of: scholarly article
title: On certain regular graphs of girth 5
zbMATH Open document ID: 0578.05039
DOI: 10.1155/S0161171284000806
author: B. George
published in: International Journal of Mathematics and Mathematical Sciences
publication date: 1984-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/45987
review text: Let f(v,g) be the number of vertices of a (v,g)-cage (regular graph of degree v and girth g with the least possible number of vertices). In the paper it is proved: Theorem. Let \(v\geq 7\) be an integer such that v-2 is a prime power. Then the following statements hold: (a) \(f(v,5)\leq 2(v- 2)^ 2\) (b) If n is an integer such that \(3\leq n\leq v\), then \(f(n,5)\leq 2(v-2)(n-2).\)
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05B15
zbMATH DE Number: 3924820
zbMATH Keywords: cage
zbMATH Keywords: latin square
zbMATH Keywords: regular graph
reviewed by: Peter Horák
MaRDI profile type: Publication
OpenAlex ID: W2028715747
description: scientific article; zbMATH DE number 3924820