Exploració per autor "Cáceres, José"
Ara es mostren els items 1-13 de 13
-
Dominating 2- broadcast in graphs: complexity, bounds and extremal graphs
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (2017-10-16)
Report de recerca
Accés obertLimited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the ... -
Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs
Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz (2018-04-20)
Article
Accés obertLimited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the ... -
General bounds on limited broadcast domination
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz; Cáceres, José (2016-09-19)
Report de recerca
Accés obertLimited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded by a constant k . The minimum cost of such a dominating broadcast is the k -broadcast dominating ... -
General bounds on limited broadcast domination
Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Cáceres, José; Puertas, M. Luz (Chapman & Hall/CRC, 2018-10-26)
Article
Accés obertDominating broadcasting is a domination-type structure that models a transmission antenna network. In this paper, we study a limited version of this structure, that was proposed as a common framework for both broadcast and ... -
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 ... -
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 metric dimension of infinite graphs
Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz (2012-12-07)
Article
Accés restringit per política de l'editorialA set of vertices Sresolves a 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 this paper ... -
Perfect and quasiperfect domination in trees
Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, Maria Luz (2016-04-25)
Article
Accés obertA k quasip erfect dominating set of a connected graph G is a vertex subset S such that every vertex not in S is adjacent to at least one and at most k vertices in S . The cardinality of a minimum k-quasip erfect dominating ... -
Quasiperfect domination in trees
Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas, M. Luz (2015-12-18)
Article
Accés obertA k–quasiperfect dominating set ( k=1k=1) of a graph G is a vertex subset S such that 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 dominating ... -
Strong product of graphs: Geodetic and hull number and boundary-type sets
Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz (2009-12)
Report de recerca
Accés obert -
The graph distance game and some graph operations
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 obertIn the graph distance game, two players alternate in constructing a max- imal path. The objective function is the distance between the two endpoints of the path, which one player tries to maximize and the other tries to ...