Abstract:Total Domination and Open Packing forms a primal-dual pair of problems. A vertex subset S of a graph G is called an open packing in G if no pair of distinct vertices in S have a common neighbour in G. The cardinality of a maximum open packing in G is called the open packing number, ρᵒ(G), of G which is a lower bound for the total domination number of G. Given a graph G and a positive integer k, the problem OPEN PACKING tests whether G has an open packing of size at least k. It is known that OPEN PACKING is NP-… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.