# Search results for: Ismael G. Yero

Journal of Combinatorial Optimization > 2019 > 38 > 1 > 130-149

*D*is an efficient closed domination digraph if there exists a subset

*S*of

*V*(

*D*) for which the closed out-neighborhoods centered in vertices of

*S*form a partition of

*V*(

*D*). In this work we deal with efficient closed domination digraphs among several product of digraphs. We completely describe the efficient closed domination digraphs among lexicographic and strong products of digraphs. We characterize...

Discrete Applied Mathematics > 2018 > 236 > C > 270-287

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 287-299

Applied Mathematics and Computation > 2017 > 314 > C > 429-438

_{G}(w, x) ≠ d

_{G}(w, y). A set S of vertices in a connected graph G is a mixed metric generator for G if every two distinct elements (vertices or edges) of G are distinguished by some vertex of S. The smallest cardinality of a mixed metric generator for G is called the mixed metric dimension...

Applied Mathematics and Computation > 2017 > 300 > C > 60-69

_{G}(u, w

_{i}) ≠ d

_{G}(v, w

_{i}) for every i∈{1,…,k}. A metric generator of minimum cardinality is called a k-metric basis and its cardinality the k-metric dimension of G. We make a study concerning the complexity of some k-metric dimension...

Discrete Applied Mathematics > 2017 > 219 > C > 65-73

Discussiones Mathematicae Graph Theory > 2017 > 37 > 1 > 273-293

Discrete Applied Mathematics > 2017 > 217 > P3 > 613-621

Discussiones Mathematicae Graph Theory > 2016 > 36 > 4 > 1051-1064

Discrete Mathematics > 2016 > 339 > 7 > 1924-1934

Results in Mathematics > 2017 > 71 > 1-2 > 509-526

*G*, a vertex $${w \in V(G)}$$ w ∈ V ( G ) distinguishes two different vertices

*u*,

*v*of

*G*if the distances between

*w*and

*u*, and between

*w*and

*v*are different. Moreover,

*w*strongly resolves the pair

*u*,

*v*if there exists some shortest

*u*−

*w*path containing

*v*or some shortest

*v*−

*w*path containing

*u*. A set

*W*of vertices is a (strong) metric generator for

*G*if every pair of...

Information Sciences > 2016 > 328 > Complete > 403-417

Bulletin of the Malaysian Mathematical Sciences Society > 2016 > 39 > 1 > 199-217

*S*of vertices of a graph

*G*is a dominating set in

*G*if every vertex outside of

*S*is adjacent to at least one vertex belonging to

*S*. A domination parameter of

*G*is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of

*G*. Here, we investigate several domination-related parameters in rooted product graphs.

Open Mathematics > 2015 > 13 > 1

Open Mathematics > 2015 > 13 > 1

Discrete Mathematics > 2014 > 335 > Complete > 8-19

Electronic Notes in Discrete Mathematics > 2014 > 46 > Complete > 1-2

Electronic Notes in Discrete Mathematics > 2014 > 46 > Complete > 121-128

Electronic Notes in Discrete Mathematics > 2014 > 46 > Complete > 169-176

Discrete Applied Mathematics > 2014 > 167 > Complete > 94-99