Gloria López-Chávez

  • Citations Per Year
Learn More
Let 2 ≤ r < m and g be positive integers. An ({r,m}; g)–graph (or biregular graph) is a graph with degree set {r,m} and girth g, and an ({r,m}; g)–cage (or biregular cage) is an ({r,m}; g)–graph of minimum order n({r,m}; g). If m = r + 1, an ({r,m}; g)–cage is said to be a semiregular cage. In this extended abstract we construct two infinite families of(More)
Let 2 6 r < m and g be positive integers. An ({r,m}; g)–graph (or biregular graph) is a graph with degree set {r,m} and girth g, and an ({r,m}; g)–cage (or biregular cage) is an ({r,m}; g)–graph of minimum order n({r,m}; g). If m = r+1, an ({r,m}; g)–cage is said to be a semiregular cage. In this paper we generalize the reduction and graph amalgam(More)
Let 2 ≤ r < m and g ≥ 4 even be three positive integers. A graph with a degree set {r,m}, girth g and minimum order is called a bi-regular cage or an ({r,m}; g)-cage, and its order is denoted by n({r,m}; g). In this paper we obtain constructive upper bounds on n({r,m}; g) for some values of r,m and even girth at least 8.
  • 1