Exploració per autor "Fabila Monroy, Ruy"
Ara es mostren els items 11-17 de 17
-
On k-gons and k-holes in point sets
Aichholzer, Oswin; Fabila Monroy, Ruy; Gonzalez Aguilar, Hernan; Hackl, Thomas; Heredia, Marco A.; Huemer, Clemens; Urrutia Galicia, Jorge; Valtr, Pavel; Vogtenhuber, Birgit (2015-08-01)
Article
Accés obertWe consider a variation of the classical Erdos-Szekeres problems on the existence and number of convex k-gons and k-holes (empty k-gons) in a set of n points in the plane. Allowing the k-gons to be non-convex, we show ... -
On the Laplacian spectra of token graphs
Dalfó Simó, Cristina; Duque, Frank; Fabila Monroy, Ruy; Fiol Mora, Miquel Àngel; Huemer, Clemens; Trujillo Negrete, Ana Laura; Zaragoza Martínez, Francisco (Elsevier, 2021-09-15)
Article
Accés obertWe study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The k-token graph of a graph G is the graph whose vertices are the k-subsets of vertices from G, two of which being adjacent whenever ... -
Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
Fabila Monroy, Ruy; Hidalgo Toscano, Carlos; Huemer, Clemens; Lara, Dolores; Mitsche, Dieter (Springer, 2018)
Comunicació de congrés
Accés restringit per política de l'editorialHow to draw the vertices of a complete multipartite graph G on different points of a bounded d-dimensional integer grid, such that the sum of squared distances between vertices of G is (i) minimized or (ii) maximized? For ... -
Perfect matchings with crossings
Aichholzer, Oswin; Fabila Monroy, Ruy; Kindermann, Philipp; Parada Muñoz, Irene María de; Paul, Rosna; Perz, Daniel; Schnider, Patrick; Vogtenhuber, Birgit (Springer Nature, 2023-07-18)
Article
Accés obertFor sets of n points, n even, in general position in the plane, we consider straight-line drawings of perfect matchings on them. It is well known that such sets admit at least Cn/2 different plane perfect matchings, where ... -
Proximity graphs inside large weighted graphs
Ábrego, Bernardo M.; Fabila Monroy, Ruy; Fernández-Merchant, Silvia; Flores Peñaloza, David; Hurtado Díaz, Fernando Alfredo; Meijer, Henk; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria (2010)
Text en actes de congrés
Accés obertGiven a large weighted graph G = (V;E) and a subset U of V , we de¯ne several graphs with vertex set U in which two vertices are adjacent if they satisfy some prescribed proximity rule. These rules use the shortest path ... -
Some results on the laplacian spectra of Token graphs
Dalfó Simó, Cristina; Duque, Frank; Fabila Monroy, Ruy; Fiol Mora, Miquel Àngel; Huemer, Clemens; Trujillo Negrete, Ana Laura; Zaragoza Martínez, Francisco (Springer, 2021)
Text en actes de congrés
Accés obertWe study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The k-token graph Fk(G) of a graph G is the graph whose vertices are the k-subsets of vertices from G, two of which being adjacent ... -
The connectivity of the flip graph of Hamiltonian paths of the grid graph
Duque, Frank; Fabila Monroy, Ruy; Flores Peñazola, David; Hidalgo Toscano, Carlos; Huemer, Clemens (2017)
Text en actes de congrés
Accés obertLet Gn,m be the grid graph with n columns and m rows. Let Hn,m be the graph whose vertices are the Hamiltonian paths in Gn,m, where two vertices P1 and P2 are adjacent if we can obtain P2 from P1 by deleting an edge in P1 ...