@article{Cabulao_Isla_2021, title={On Connected Partial Domination in Graphs}, volume={14}, url={https://ejpam.com/index.php/ejpam/article/view/4168}, DOI={10.29020/nybg.ejpam.v14i4.4168}, abstractNote={<p>This paper introduces and investigates a variant of partial domination called the connected Î±-partial domination. For any graph G = (V (G), E(G)) and Î± âˆˆ (0, 1], a set S âŠ† V (G) is an Î±-partial dominating set in G if |N[S]| â‰¥ Î± |V (G)|. An Î±-partial dominating set S âŠ† V (G) is a connected Î±-partial dominating set in G if âŸ¨SâŸ©, the subgraph induced by S, is connected. The connected Î±-partial domination number of G, denoted by âˆ‚CÎ±(G), is the smallest cardinality of a connected Î±-partial dominating set in G. In this paper, we characterize the connected Î±-partial dominating sets in the join and lexicographic product of graphs for any Î± âˆˆ (0, 1] and determine the corresponding connected Î±-partial domination numbers of graphs resulting from the said binary operations. Moreover, we establish sharp bounds for the connected Î±-partial domination numbers of the corona and Cartesian product of graphs. Furthermore, we determine âˆ‚CÎ±(G) of some special graphs when Î± =1/2. Several realization problems are also generated in this paper.</p>}, number={4}, journal={European Journal of Pure and Applied Mathematics}, author={Cabulao, Jessa Mae Carpentero and Isla, Rowena T.}, year={2021}, month={Nov.}, pages={1490–1506} }