473 citations · 496 across the 17 of their papers we have counts for
19 papers
Paired and semipaired domination in triangulations
M. Claverol, C. Hernando, M. Maureso +2
A dominating set of a graph is a subset of vertices such that every vertex not in is adjacent to at least one vertex in . A dominating set is paired if the subgr…
The Equidistant Dimension of Graphs
A. González, C. Hernando, M. Mora
A subset of vertices of a connected graph is a distance-equalizer set if for every two distinct vertices there is a vertex such that…
Total domination in plane triangulations
M. Claverol, A. García, G. Hernández +4
A total dominating set of a graph is a subset of such that every vertex in is adjacent to at least one vertex in . The total domination number of , deno…
Metric dimension of maximal outerplanar graphs
Mercè Claverol, Alfredo García, Greogorio Hernández +4
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if is the metric dimension of a maximal outerplanar graph of order , w…
The Neighbor-Locating-Chromatic Number of Pseudotrees
Liliana Alcon, Marisa Gutierrez, Carmen Hernando +2
A -coloring of a graph is a partition of the set of vertices of into independent sets, which are called colors. A -coloring is neighbor-locating if any two vertic…
Neighbor-Locating Colorings in Graphs
Liliana Alcon, Marisa Gutierrez, Carmen Hernando +2
A -coloring of a graph is a -partition of into independent sets, called \emph{colors}. A -coloring is called \emph{neighbor-locating} if…