Biregular cages of girth five
Combinatorics
2015-01-13 v1
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.
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}
}