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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.