#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2006

2017

- This year (1)
- Last 5 years (10)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Anthony Dekker, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Paul A. Watters
- J. Math. Model. Algorithms
- 2012

We introduce the problem of finding the largest subgraph of a given weighted undirected graph (host graph), subject to constraints on the maximum degree and the diameter. We discuss some applications in security, network design and parallel processing, and in connection with the latter we derive some bounds for the order of the largest subgraph in host… (More)

- 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 embeddable 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 in… (More)

- Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio
- Eur. J. Comb.
- 2009

It is known that the Moore bipartite bound provides an upper bound on the order of a connected bipartite graph. In this paper we deal with bipartite graphs of maximum degree ∆ ≥ 2, diameter D ≥ 2 and defect 2 (having 2 vertices less than the Moore bipartite bound). We call such graphs bipartite (∆, D,−2)-graphs. We find that the eigenvalues other than ±∆ of… (More)

- Charles Delorme, Guillermo Pineda-Villavicencio
- Electr. J. Comb.
- 2010

The Moore bound constitutes both an upper bound on the order of a graph of maximum degree d and diameter D = k and a lower bound on the order of a graph of minimum degree d and odd girth g = 2k + 1. Graphs missing or exceeding the Moore bound by ǫ are called graphs with defect or excess ǫ, respectively. While Moore graphs (graphs with ǫ = 0) and graphs with… (More)

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

- Guillermo Pineda-Villavicencio, David R. Wood
- Electr. J. Comb.
- 2015

The degree-diameter problem asks for the maximum number of vertices in a graph with maximum degree ∆ and diameter k. For fixed k, the answer is Θ(∆k). We consider the degree-diameter problem for particular classes of sparse graphs, and establish the following results. For graphs of bounded average degree the answer is Θ(∆k−1), and for graphs of bounded… (More)

Given a tesselation of the plane, defined by a planar straightline graph G, we want to find a minimal set S of points in the plane, such that the Voronoi diagram associated with S ‘fits’ G. This is the Generalized Inverse Voronoi Problem (GIVP), defined in [12] and rediscovered recently in [3]. Here we give an algorithm that solves this problem with a… (More)

- Eran Nevo, Guillermo Pineda-Villavicencio, David R. Wood
- J. Comb. Theory, Ser. B
- 2016

The maximum number of vertices in a graph of maximum degree ∆ ≥ 3 and fixed diameter k ≥ 2 is upper bounded by (1 + o(1))(∆ − 1). If we restrict our graphs to certain classes, better upper bounds are known. For instance, for the class of trees there is an upper bound of (2 + o(1))(∆ − 1)bk/2c for a fixed k. The main result of this paper is that graphs… (More)

- Guillermo Pineda-Villavicencio, José Gómez, Mirka Miller, Hebert Pérez-Rosés
- Networks
- 2009

In the pursuit of obtaining largest graphs of given maximum degree ∆ and diameter D, many construction techniques have been developed. Compounding of graphs is one such technique. In this paper, by means of the compounding of complete graphs into a Moore bipartite graph of diameter 6, we obtain a family of large graphs of the same diameter. For ∗Research… (More)

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