Biregular cages of girth five
M. Abreu, G. Araujo-Pardo, C. Balbuena, D. Labbate, G. Lopez-Chavez

TL;DR
This paper introduces new infinite families of biregular cages with girth five by extending existing graph operations, and constructs specific semiregular cages with small orders.
Contribution
It generalizes reduction and amalgam operations to produce two new infinite families of biregular cages and two semiregular cages, expanding known cage constructions.
Findings
Constructed $({r,2r-3};5)$-cages for all $r=q+1$ with $q$ prime power.
Constructed $({r,2r-5};5)$-cages for all $r=q+1$ with $q$ prime.
Built semiregular cages with 31 and 43 vertices for $r=5$ and $r=6$.
Abstract
Let and be positive integers. An --graph} (or biregular graph) is a graph with degree set and girth , and an -cage (or biregular cage) is an -graph of minimum order . If , an -cage is said to be a semiregular cage. In this paper we generalize the reduction and graph amalgam operations from M. Abreu, G. Araujo-Pardo, C. Balbuena, D. Labbate (2011) on the incidence graphs of an affine and a biaffine plane obtaining two new infinite families of biregular cages and two new semiregular cages. The constructed new families are -cages for all with a prime power, and -cages for all with a prime. The new semiregular cages are constructed for r=5 and 6 with 31 and 43 vertices respectively.
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
Topicsgraph theory and CDMA systems · Finite Group Theory Research · Coding theory and cryptography
