On (a, k)-sets and (a, k)-hulls in the plane

Autor: Claverol Aguas, Mercè, Herrera Becerra, Luís Hernán, Seara Ojea, Carlos, Pérez Lantero, Pablo

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

This abstract reports first the study of upper and lower bounds for the maximum number of all the combinatorially different (a, k)-sets of an n-point set P in the plane, 0 < a = p and 0 < 2k < n, depending on the (fixed/variable) values of a and k, r

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9a5a27dffe5e2fdf520d8804a0fb490f
http://hdl.handle.net/2117/361258

Trees whose even-degree vertices induce a path are antimagic

Autor: Lozano Bojados, Antoni, Mora Giné, Mercè, Seara Ojea, Carlos, Tey Carrera, Joaquín

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . . , |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels assigned to edges incident to

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::369c56918dc8a20c57cb110ec012ff52
http://hdl.handle.net/2117/133369

On the Oß-hull of a planar point set

Autor: Alegría Galicia, Carlos, Orden, David, Seara Ojea, Carlos, Urrutia Galicia, Jorge

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ We study the Oß-hull of a planar point set, a generalization of the Orthogonal Convex Hull where the coordinate ax

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f0440486769492be5e8611e1d998f2d1
http://hdl.handle.net/2117/180893

Some structural, metric and convex properties of the boundary of a graph

Autor: Hernando Martín, María del Carmen, Mora Giné, Mercè, Pelayo Melero, Ignacio Manuel, Seara Ojea, Carlos

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

Let u;v be two vertices of a connected graph G . The vertex v is said to be a boundary vertex of u if no neighbor of v is further away from u than v . The boundary of a graph is the set of all its boundary vertices. In this work, we present a number

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::aa8750f4b43375f3c2de5091b48cc98f
https://hdl.handle.net/2117/20898

Extremal graph theory for metric dimension and diameter

Autor: Hernando Martín, María del Carmen|||0000-0002-3864-6566, Mora Giné, Mercè|||0000-0001-6923-0320, Seara Ojea, Carlos|||0000-0002-0095-1725, Wood, David

Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

A set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G. Let G ,D be the set of graphs with

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0389cc2c8dc108a004baa317711cbaab
https://hdl.handle.net/2117/8261