Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs

Bose, Prosenjit; Cano, Pilar; Saumell, Maria; Silveira, Rodrigo I.

doi:10.1007/978-3-030-24766-9_15

Cited by 2 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A Hamilton path of G is a path passing exactly once through every vertex of G. A Hamilton cycle is a closed Hamilton path. We refer to [2][3][4] for some recent results on the Hamiltonian properties of graphs. e domination theory of graphs is an important part of graph theory because of its wide range of applications and theoretical significance [5,6]…”

Section: Introductionmentioning

confidence: 99%

Hamiltonicity of $3_{t} EC$ Graphs with $α$

Zhao

2021

Journal of Mathematics

View full text Add to dashboard Cite

A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S . The minimum cardinality of a total dominating set of G is the total domination number γ t G of G . The graph G is total domination edge-critical, or γ t EC , if for every edge e in the complement of G , γ t G + e < γ t G . If G is γ t EC and γ t G = k , we say that G is k t EC . In this paper, we show that every 3 t EC graph with δ G ≥ 2 and α G = κ G + 1 has a Hamilton cycle.

show abstract

Section: Introductionmentioning

confidence: 99%

Hamiltonicity of $3_{t} EC$ Graphs with $α$

Zhao

2021

Journal of Mathematics

View full text Add to dashboard Cite

show abstract

“…Hamiltonicity for convex shape Delaunay and Gabriel graphs. Computational Geometry, to appear, 2020 [28] In Chapter 5 we revisit an affine invariant triangulation defined by Gregory M. Nielson [86], that uses the inverse of the covariance matrix of S to define an affine invariant norm, denoted A S , and an affine invariant triangulation, denoted DT A S (S). The A S -norm is a special kind of C-distance where C is replaced by a type of ellipse.…”

Section: Outlinementioning

confidence: 99%

Generalized Delaunay triangulations : graph-theoretic properties and algorithms

Cano Vila

View full text Add to dashboard Cite

This thesis studies different generalizations of Delaunay triangulations, both from a combinatorial and algorithmic point of view. The Delaunay triangulation of a point set S, denoted DT(S), has vertex set S. An edge uv is in DT(S) if it satisfies the empty circle property: there exists a circle with u and v on its boundary that does not enclose points of S. Due to different optimization criteria, many generalizations of the DT(S) have been proposed. Several properties are known for DT(S), yet, few are known for its generalizations. The main question we explore is: to what extent can properties of DT(S) be extended for generalized Delaunay graphs? First, we explore the connectivity of the flip graph of higher order Delaunay triangulations of a point set S in the plane. The order-k flip graph might be disconnected for k = 3, yet, we give upper and lower bounds on the flip distance from one order-k triangulation to another in certain settings. Later, we show that there exists a length-decreasing sequence of plane spanning trees of S that converges to the minimum spanning tree of S with respect to an arbitrary convex distance function. Each pair of consecutive trees in the sequence is contained in a constrained convex shape Delaunay graph. In addition, we give a linear upper bound and specific bounds when the convex shape is a square. With focus still on convex distance functions, we study Hamiltonicity in k-order convex shape Delaunay graphs. Depending on the convex shape, we provide several upper bounds for the minimum k for which the k-order convex shape Delaunay graph is always Hamiltonian. In addition, we provide lower bounds when the convex shape is in a set of certain regular polygons. Finally, we revisit an affine invariant triangulation, which is a special type of convex shape Delaunay triangulation. We show that many properties of the standard Delaunay triangulations carry over to these triangulations. Also, motivated by this affine invariant triangulation, we study different triangulation methods for producing other affine invariant geometric objects. Esta tesis estudia diferentes generalizaciones de la triangulación de Delaunay, tanto desde un punto de vista combinatorio como algorítmico. La triangulación de Delaunay de un conjunto de puntos S, denotada DT(S), tiene como conjunto de vértices a S. Una arista uv está en DT(S) si satisface la propiedad del círculo vacío: existe un círculo con u y v en su frontera que no contiene ningún punto de S en su interior. Debido a distintos criterios de optimización, se han propuesto varias generalizaciones de la DT (S). Hoy en día, se conocen bastantes propiedades de la DT(S), sin embargo, poco se sabe sobre sus generalizaciones. La pregunta principal que exploramos es: ¿Hasta qué punto las propiedades de la DT(S) se pueden extender para generalizaciones de gráficas de Delaunay? Primero, exploramos la conectividad de la gráfica de flips de las triangulaciones de Delaunay de orden alto de un conjunto de puntos S en el plano. La gráfica de flips de triangulaciones de orden k = 3 podría ser disconexa, sin embargo, nosotros damos una cota superior e inferior para la distancia en flips de una triangulación de orden k a alguna otra cuando S cumple con ciertas características. Luego, probamos que existe una secuencia de árboles generadores sin cruces tal que la suma total de la longitud de las aristas con respecto a una distancia convexa arbitraria es decreciente y converge al árbol generador mínimo con respecto a la distancia correspondiente. Cada par de árboles consecutivos en la secuencia se encuentran en una triangulación de Delaunay con restricciones. Adicionalmente, damos una cota superior lineal para la longitud de la secuencia y cotas específicas cuando el conjunto convexo es un cuadrado. Aún concentrados en distancias convexas, estudiamos hamiltonicidad en las gráficas de Delaunay de distancia convexa de k-orden. Dependiendo en la distancia convexa, exhibimos diversas cotas superiores para el mínimo valor de k que satisface que la gráfica de Delaunay de distancia convexa de orden-k es hamiltoniana. También damos cotas inferiores para k cuando el conjunto convexo pertenece a un conjunto de ciertos polígonos regulares. Finalmente, re-visitamos una triangulación afín invariante, la cual es un caso especial de triangulación de Delaunay de distancia convexa. Probamos que muchas propiedades de la triangulación de Delaunay estándar se preservan en estas triangulaciones. Además, motivados por esta triangulación afín invariante, estudiamos diferentes algoritmos que producen otros objetos geométricos afín invariantes.

show abstract

Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs

Cited by 2 publications

References 15 publications

Hamiltonicity of $3_{t} EC$ Graphs with $α$

Hamiltonicity of $3_{t} EC$ Graphs with $α$

Generalized Delaunay triangulations : graph-theoretic properties and algorithms

Contact Info

Product

Resources

About

Hamiltonicity for Convex Shape Delaunay and Gabriel Graphs

Cited by 2 publications

References 15 publications

Hamiltonicity of 3 t EC Graphs with α

Hamiltonicity of 3 t EC Graphs with α

Generalized Delaunay triangulations : graph-theoretic properties and algorithms

Contact Info

Product

Resources

About

Hamiltonicity of $3_{t} EC$ Graphs with $α$

Hamiltonicity of $3_{t} EC$ Graphs with $α$