Paired and semipaired domination in near-triangulations

Autor: Hernando Martín, María del Carmen, Claverol Aguas, Mercè, Maureso Sánchez, Montserrat, Mora Giné, Mercè, Tejel Altarriba, Francisco Javier

A dominating set of a graph G is a subset D of vertices such that every vertex not in D is adjacent to at least one vertex in D. A dominating set D is paired if the subgraph induced by its vertices has a perfect matching, and semipaired if every vert

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3484::3594e60dccc99b15fb18d477f9f9c81b
https://hdl.handle.net/2117/374877

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

Coloración de grafos por vecindades diferentes

Autor: Hernando Martín, María del Carmen|||0000-0002-3864-6566, Mora Giné, Mercè|||0000-0001-6923-0320, Pelayo Melero, Ignacio Manuel|||0000-0002-6523-0611, Alcom, Liliana, Gutierrez, Marisa

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)

En este trabajo de nimos las coloraciones de un grafo que lo resuelven por vecindad. Notamos NL ( G ) al cardinal m nimo de una de estas coloraciones consideradas del grafo G . Estudiamos propiedades generales de estas coloraciones, valores concretos

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

Location in maximal outerplanar graphs

Autor: Claverol Aguas, Mercè, García, Alfredo, Hernández, Gregorio, Hernando Martín, María del Carmen, Maureso Sánchez, Montserrat, Mora Giné, Mercè, Tejel, Javier

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

In this work we study the metric dimension and the location-domination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal outerplanar graphs attaining the

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

On the Partition Dimension and the Twin Number of a Graph

Autor: Hernando Martín, María del Carmen|||0000-0002-3864-6566, Mora Giné, Mercè|||0000-0001-6923-0320, Pelayo Melero, Ignacio Manuel|||0000-0002-6523-0611

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 partition of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of . The partition dimension of G is the minimum cardinality of a locating partition o

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