#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2011

2015

- This year (0)
- Last five years (6)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ramiro Feria-Purón, Guillermo Pineda-Villavicencio
- Discrete Applied Mathematics
- 2012

We consider the bipartite version of the degree/diameter problem, namely, given natural numbers ∆ ≥ 2 and D ≥ 2, find the maximum number N b (∆, D) of vertices in a bipartite graph of maximum degree ∆ and diameter D. In this context, the Moore bipartite bound M b (∆, D) represents an upper bound for N b (∆, D). Bipartite graphs of maximum degree ∆, diameter… (More)

- Ramiro Feria-Purón, Mirka Miller, Guillermo Pineda-Villavicencio
- Discrete Applied Mathematics
- 2011

In this paper we consider the degree/diameter problem, namely, given natural numbers ∆ ≥ 2 and D ≥ 1, find the maximum number N(∆, D) of vertices in a graph of maximum degree ∆ and diameter D. In this context, the Moore bound M(∆, D) represents an upper bound for N(∆, D). Graphs of maximum degree ∆, diameter D and order M(∆, D), called Moore graphs, turned… (More)

- Ramiro Feria-Purón, Joe Ryan, Hebert Pérez-Rosés
- Electronic Notes in Discrete Mathematics
- 2014

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 then we describe and implement a computer-based method to find large circulant graphs with given parameters. For several combinations of degree and diameter , our algorithm… (More)

- Ramiro Feria-Purón, Mirka Miller, Guillermo Pineda-Villavicencio
- Discrete Mathematics
- 2013

- Ramiro Feria-Purón, Guillermo Pineda-Villavicencio
- Graphs and Combinatorics
- 2014

We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface Σ and integers ∆ and k, determine the maximum order N (∆, k, Σ) of a graph em-beddable in Σ with maximum degree ∆ and diameter k. We introduce a number of constructions which produce many new largest known planar and toroidal graphs. We record all these graphs… (More)

- Stephan Dominique Andres, János Barát, +20 authors Jakub Gajarský

as all the activities (including the lunches) could be taken on the same site. Besides, as it was expressed by several participants, the renovated faculty building surely belongs to the most beautiful math and computer science departments in the world! The workshop was organized by the Only a small but distinguished group of mathematicians was invited and… (More)

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 general results are available, and most papers deal with particular classes of graphs and methods. Here we approach the problem from the computational viewpoint, and in a quite general… (More)

- ‹
- 1
- ›