English

Biregular cages of girth five

Combinatorics 2015-01-13 v1

Abstract

Let 2r<m2 \le r < m and gg be positive integers. An (r,m;g)({r,m};g)--graph} (or biregular graph) is a graph with degree set r,m{r,m} and girth gg, and an (r,m;g)({r,m};g)-cage (or biregular cage) is an (r,m;g)({r,m};g)-graph of minimum order n(r,m;g)n({r,m};g). If m=r+1m=r+1, an (r,m;g)({r,m};g)-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 (r,2r3;5)({r,2r-3};5)-cages for all r=q+1r=q+1 with qq a prime power, and (r,2r5;5)({r,2r-5};5)-cages for all r=q+1r=q+1 with qq a prime. The new semiregular cages are constructed for r=5 and 6 with 31 and 43 vertices respectively.

Keywords

Cite

@article{arxiv.1211.0910,
  title  = {Biregular cages of girth five},
  author = {M. Abreu and G. Araujo-Pardo and C. Balbuena and D. Labbate and G. Lopez-Chavez},
  journal= {arXiv preprint arXiv:1211.0910},
  year   = {2015}
}
R2 v1 2026-06-21T22:33:04.334Z