Buscar
Mostrando ítems 81-90 de 116
Artículo
On the connectivity of skeletons of pseudomanifolds with boundary
(Mathematical Institute, Academy of Sciences of the Czech Republic, 2002)
In this note we show that 1-skeletons and 2-skeletons of n-pseudomanifolds with full boundary are (n+ 1)-connected graphs and n-connected 2-complexes, respectively. This generalizes previous results due to Barnette and Woon.
Artículo
Resolving sets for Johnson and Kneser graphs
(2013)
A set of vertices SS in a graph GG is a resolving set for GG if, for any two vertices u,vu,v, there exists x∈Sx∈S such that the distances d(u,x)≠d(v,x)d(u,x)≠d(v,x). In this paper, we consider the Johnson graphs J(n,k)J(n,k) ...
Artículo
Towards a new framework for domination
(2011)
Dominating concepts constitute a cornerstone in Graph Theory. Part of the efforts in the field have been focused in finding different mathematical frameworks where domination notions naturally arise, providing new points ...
Artículo
Reporting Bichromatic Segment Intersections from Point Sets
(2012)
In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets of segments. Given two sets R and B of n points in the plane defining two sets of segments, say red ...
Tesis Doctoral
Transversalidad en grafos numerales localmente finitos
(1993-11-19)
Los primeros problemas que plantearon y resolvieron en Teoría de Grafos, son problemas referentes a la Transversalidad de Grafos (la posibilidad de recorrer o bien las aristas o bien los vértices de un grafo sin repetición), ...
Ponencia
Differential evolution in shortest path problems
(Universidad de Almería, 2011)
This paper proves that the Di erential Evolution (DE) algorithm is valid to solve the Shortest Path (SP) problem in random, median sized networks. From the trials, we have obtained an 9% accuracy, in the worst case scenario.
Artículo
Shortcut sets for plane Euclidean networks (Extended abstract)
(Elsevier, 2016)
We study the problem of augmenting the locus N of a plane Euclidean network N by inserting iteratively a finite set of segments, called shortcut set, while reducing the diameter of the locus of the resulting network. ...
Artículo
Transforming Triangulations on Nonplanar Surfaces
(2010)
We consider whether any two triangulations of a polygon or a point set on a nonplanar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some ...
Ponencia
Tutte unicidad: grafos localmente grid y grados localmente C6
(Alberto Márquez, 2002)
Artículo
On the connectivity of infinite graphs and 2-complexes
(Elsevier, 1999)
This paper contains a study of the connectivity of infinite graphs and 2-complexes. Various connectivity types are defined and relationships among them are given. In addition new Menger-Whitney type theorems are stated for ...