Resumen de A survey on dominating sets: bounds and algorithms

Ernesto Parra Inza, José María Sigarreta Almira , Nodari Vakhania, Juan C. Hernández

• A subset S of vertices in a graph G is called a dominating set of G if every vertex in G has at least one neighbor in S or is in S. In this article, we provide an accessible introduction to the fundamental concepts of domination in graphs, exploring its importance and applications in areas such as networks, biology, and optimization through examples and recent results.