Exploració per autor "Hernando Martín, María del Carmen"
Ara es mostren els items 14-33 de 62
-
LD-graphs and global location-domination in bipartite graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014)
Text en actes de congrés
Accés obertA dominating setS of a graph G is a locating-dominating-set, 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 ... -
LD-graphs and global location-domination in bipartite graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014-09-02)
Article
Accés restringit per política de l'editorialA dominating set S of a graph G is a locating-dominating-set, 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 ... -
Limited broadcast domination: upper bounds and complexity
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-07-07)
Capítol de llibre
Accés restringit per política de l'editorialEn 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 ... -
Locating domination in bipartite graphs and their complements
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2018-01-01)
Article
Accés obertA set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ... -
Locating domination in bipartite graphs and their complements
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-11-03)
Report de recerca
Accés obertA set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ... -
Locating domination in bipartites graphs and their complements
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-07-07)
Capítol de llibre
Accés restringit per política de l'editorialEn 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 ... -
Locating domination in graphs and their complements
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (Universidad de Sevilla, 2013-10-16)
Capítol de llibre
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 ... -
Locating-dominating codes: Bounds and extremal cardinalities
Cáceres, Jose; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz (2013-09-01)
Article
Accés restringit per política de l'editorialIn this work, two types of codes such that they both dominate and locate the vertices of a graph are studied. Those codes might be sets of detectors in a network or processors controlling a system whose set of responses ... -
Locating-dominating partitions in graphs
Pelayo Melero, Ignacio Manuel; Hernando Martín, María del Carmen; Mora Giné, Mercè (2016)
Text en actes de congrés
Accés obertLet G = (V, E) be a connected graph of order n. Let ¿ = {S1, . . . , Sk} be a partition of V . Let r(u|¿) denote the vector of distances between a vertex v ¿ V and the elements of ¿, that is, r(v, ¿) = (d(v, S1), . . . ... -
Location in maximal outerplanar graphs
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 (2017)
Text en actes de congrés
Accés restringit per política de l'editorialIn 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 ... -
Metric dimension of maximal outerplanar graphs
Claverol Aguas, Mercè; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè (2021-02-02)
Article
Accés obertIn this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if ß(G) denotes the metric dimension of a maximal outerplanar graph G of order n, we prove that 2=ß(G)=¿2n5¿ and that the ... -
Metric dimension of maximal outerplanar graphs
Claverol Aguas, Mercè; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Hernández Peñalver, Gregorio; Garcia Olaverri, Alfredo Martin; Tejel, Javier (2019-03-28)
Report de recerca
Accés obert -
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 ... -
Metric-locating-dominating sets of graphs for constructing related subsets of vertices
Hernando Martín, María del Carmen; Mora Giné, Mercè; González Herrera, Antonio (2018-09-01)
Article
Accés obertA dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of S , and the minimum cardinality of such a set is called the ... -
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 ... -
New results on metric-locating-dominating sets of graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; González, Antonio (2016-04-13)
Report de recerca
Accés obertA dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distanc es from the elements of S , and the minimum cardinality of such a set is called the ... -
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 ...