For p ∈ (0, 1], a set S ⊆ V is said to p-dominate or partially dominate a graphThe minimum cardinality among all p-dominating sets is called the p-domination number and it is denoted by γp(G). Analogously, the independent partial domination (ip(G)) is introduced and studied here independently and in relation with the classical domination. Further, the partial independent set and the partial independence number βp(G) are defined and some of their properties are presented. Finally, the partial domination chain is established as γpRESUMEN Para p ∈ (0, 1], un conjunto S ⊆ V se dice que pdomina o parcialmente domina un grafo G = (V, E) si |N [S]| |V |
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.