Gloria López-Chávez

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 paper we generalize the reduction and graph amalgam(More)
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: Abstract Let 2 ≤ r < m and g ≥ 4 even be three positive integers. A graph with a(More)
  • 1