A formulation of a (q+1,8)-cage
M. Abreu, G. Araujo-Pardo, C. Balbuena, D. Labbate

TL;DR
This paper introduces a new formulation for constructing (q+1,8)-cages, enabling the creation of smaller graphs with specified degree and girth, advancing graph theory constructions.
Contribution
The paper presents a novel formulation for (q+1,8)-cages that facilitates the construction of smaller (k,g)-graphs for specific parameters, expanding existing graph construction methods.
Findings
Constructed smaller (k,g)-graphs for k=q-1, q and g=7,8.
Developed smaller (q,8)-graphs for even prime powers q.
Provided a new formulation for known (q+1,8)-cages.
Abstract
Let be a prime power. In this note we present a formulation for obtaining the known -cages which has allowed us to construct small --graphs for and . Furthermore, we also obtain smaller -graphs for even prime power .
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
