On certain regular graphs of girth 5
From MaRDI portal
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).\)
Recommendations
Cited in
(16)- A regular graph of girth 6 and valency 11
- Altitude of regular graphs with girth at least five
- Improving bounds on the order of regular graphs of girth 5
- Wheel and star-critical Ramsey numbers for quadrilateral
- New small regular graphs of girth 5
- A census of all 5-regular planar graphs with diameter 3.
- On geometric mean graphs of order 5
- scientific article; zbMATH DE number 5954411 (Why is no real title available?)
- scientific article; zbMATH DE number 3885947 (Why is no real title available?)
- scientific article; zbMATH DE number 2616 (Why is no real title available?)
- scientific article; zbMATH DE number 1439410 (Why is no real title available?)
- scientific article; zbMATH DE number 6475975 (Why is no real title available?)
- The smallest graph of girth 5 and valency 4
- On the connectivity of cages with girth five, six and eight
- A family of regular graphs of girth 5
- On upper bounds of odd girth cages
This page was built for publication: On certain regular graphs of girth 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1066159)
