33 citations · 47 across the 6 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2024★ 2 cited
Reducing Dominating Sets in Graphs
Ernesto Parra Inza, José María Sigarreta Almira, Nodari Vakhania
A dominating set of a graph is a subset of vertices such that every vertex has at least one neighbor in set . The corresponding opti…
cs.DM2023★ 3 cited
Algorithms for the Global Domination Problem
Ernesto Parra Inza, Nodari Vakhania, Jose M. Sigarreta Almira +1
A dominating set D in a graph G is a subset of its vertices such that every vertex of the graph which does not belong to set D is adjacent to at least one vertex from set D. A set…