Pérez Contreras, Eric Paulí
(Universidad Michoacana de San Nicolás de Hidalgo. Universidad Nacional Autónoma de México, 2015-12)
Given any finite graph G = (V; A), a dominating set of G is a subset D V such as every vertex v 2 V not in D is adjacent to some vertex in D. The domination number (G) of a graph G is the minimum cardinality of a dominating ...