Exploració per autor "Pelayo Melero, Ignacio Manuel"
Ara es mostren els items 28-47 de 67
-
Matemàtiques I. Examen final
Pelayo Melero, Ignacio Manuel (Universitat Politècnica de Catalunya, 2012-01-23)
Examen
Accés restringit a la comunitat UPC -
Matemàtiques I. Examen final
Pelayo Melero, Ignacio Manuel (Universitat Politècnica de Catalunya, 2013-01-18)
Examen
Accés restringit a la comunitat UPC -
Matemàtiques I. Examen final
Pelayo Melero, Ignacio Manuel (Universitat Politècnica de Catalunya, 2011-01-18)
Examen
Accés restringit a la comunitat UPC -
Matemàtiques I. Prova parcial
Pelayo Melero, Ignacio Manuel (Universitat Politècnica de Catalunya, 2013-11-13)
Examen
Accés restringit a la comunitat UPC -
Matemàtiques I. Prova parcial
Pelayo Melero, Ignacio Manuel (Universitat Politècnica de Catalunya, 2012-11-12)
Examen
Accés restringit a la comunitat UPC -
Metric-locating-dominating partitions in graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-11-03)
Report de recerca
Accés obertA partition ¿ = { S 1 ,...,S k } of the vertex set of a connected graph G is a metric-locating partition of G if for every pair of vertices u,v belonging to the same part S i , d ( u,S j ) 6 = d ( v,S j ), for some other ... -
Neighbor-locating coloring: graph operations and extremal cardinalities
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2018-07-01)
Article
Accés obertA k–coloring of a graph is a k-partition of V into independent sets, called colors. A k-coloring is called neighbor-locating if for every pair of vertices u, v belonging to the same color , the set of colors of the ... -
Neighbor-locating colorings in graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Alcón, Liliana; Gutierrez, Marisa (2018-06-29)
Report de recerca
Accés obertA k -coloring of a graph G is a k -partition ¿ = { S 1 ,...,S k } of V ( G ) into independent sets, called colors . A k -coloring is called neighbor-locating if for every pair of vertices u,v belonging to the same color S ... -
Neighbor-locating colorings in graphs
Alcón, Liliana; Gutierrez, Marisa; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2020-02-02)
Article
Accés obertA k-coloring of a graph G is a k-partition of into independent sets, called colors. A k-coloring is called neighbor-locating if for every pair of vertices belonging to the same color , the set of colors of the neighborhood ... -
Nordhaus-Gaddum bounds for locating domination
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014-02-01)
Article
Accés restringit per política de l'editorialA dominating set S of graph G is called metric-locating–dominating if it is also locating, that is, if every vertex v is uniquely determined by its vector of distances to the vertices in S. If moreover, every vertex v not ... -
On geodetic sets formed by boundary vertices
Cáceres González, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz; Seara Ojea, Carlos (2003)
Article
Accés obertLet G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties involving different types ... -
On global location-domination in bipartite graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2015-06-10)
Report de recerca
Accés obert -
On global location-domination in graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2015-05-29)
Article
Accés obertA dominating set S of a graph G is called locating-dominating, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality ... -
On locating and dominating sets in graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Cáceres, Jose; Puertas González, María Luz; Pelayo Melero, Ignacio Manuel (2009)
Comunicació de congrés
Accés obert -
On monophonic sets in graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos (2003)
Report de recerca
Accés obert -
On perfect and quasiperfect domination in graphs
Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M Luz (2014-11-28)
Report de recerca
Accés obert -
On perfect and quasiperfect dominations in graphs
Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz (2014)
Text en actes de congrés
Accés obert -
On perfect and quasiperfect dominations in graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-02-27)
Article
Accés obertA subset S ¿ V in a graph G = ( V , E ) is a k -quasiperfect dominating set (for k = 1) if every vertex not in S is adjacent to at least one and at most k vertices in S . The cardinality of a minimum k -quasiperfect ... -
On the geodetic and the hull numbers in strong product graphs
Cáceres, Jose; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz (2010-12)
Article
Accés restringit per política de l'editorialA set S of vertices of a connected graph G is convex, if for any pair of vertices u,vS, every shortest path joining u and v is contained in S. The convex hull CH(S) of a set of vertices S is defined as the smallest convex ... -
On the metric dimension of infinite graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2009-11-04)
Article
Accés restringit per política de l'editorialA 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 a graph G is the minimum cardinality of a resolving set. In ...