An explicit formula for obtaining $(q+1,8)$-cages and others small regular graphs of girth 8
M. Abreu, G. Araujo-Pardo, C. Balbuena, D. Labbate

TL;DR
This paper provides an explicit formula for constructing $(q+1,8)$-cages and derives small regular graphs of girth 8 by removing specific dominating sets, improving known minimal vertex counts.
Contribution
It introduces a new explicit formula for $(q+1,8)$-cages and constructs smaller regular graphs of girth 8 by modifying these cages.
Findings
Explicit formula for $(q+1,8)$-cages using graphical terminology.
Construction of smaller regular graphs of girth 8 with minimal vertices.
New methods to derive graphs with specific regularity and girth properties.
Abstract
Let be a prime power; -cages have been constructed as incidence graphs of a non-degenerate quadric surface in projective 4-space . The first contribution of this paper is a construction of these graphs in an alternative way by means of an explicit formula using graphical terminology. Furthermore by removing some specific perfect dominating sets from a -cage we derive -regular graphs of girth 8 for and , having the smallest number of vertices known so far.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
