3 citations · 7 across the 3 of their papers we have counts for
6 papers
Searching for Large Circulant Graphs
Ramiro Feria-Puron, Hebert Perez-Roses, Joe Ryan
We address the problem of constructing large undirected circulant networks with given degree and diameter. First we discuss the theoretical upper bounds and their asymptotics, and…
A Heuristic for Magic and Antimagic Graph Labellings
François Bertault, Mirka Miller, Hebert Pérez-Rosés +2
Graph labellings have been a very fruitful area of research in the last four decades. However, despite the staggering number of papers published in the field (over 1000), few gener…
Constructions of Large Graphs on Surfaces
Ramiro Feria-Puron, Guillermo Pineda-Villavicencio
We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface and integers and , determine the maximum order of a graph em…
On large bipartite graphs of diameter 3
Ramiro Feria-Puron, Mirka Miller, Guillermo Pineda-Villavicencio
We consider the bipartite version of the {\it degree/diameter problem}, namely, given natural numbers and , find the maximum number of vertices in a bipa…
On graphs of defect at most 2
Ramiro Feria-Purón, Mirka Miller, Guillermo Pineda-Villavicencio
In this paper we consider the degree/diameter problem, namely, given natural numbers Δ \geq 2 and D \geq 1, find the maximum number N(Δ,D) of vertices in a graph of maximum degree…
On bipartite graphs of defect at most 4
Ramiro Feria-Purón, Guillermo Pineda-Villavicencio
We consider the bipartite version of the degree/diameter problem, namely, given natural numbers Δ \geq 2 and D \geq 2, find the maximum number Nb(Δ,D) of vertices in a bipartite gr…