Total Partial Domination in Graphs Under Some Binary Operations
Let G = (V (G), E(G)) be a simple graph and let Î± âˆˆ (0, 1]. A set S âŠ† V (G) is
an Î±-partial dominating set in G if |N[S]| â‰¥ Î± |V (G)|. The smallest cardinality of an Î±-partial
dominating set in G is called the Î±-partial domination number of G, denoted by âˆ‚Î±(G). An Î±-
partial dominating set S âŠ† V (G) is a total Î±-partial dominating set in G if every vertex in S is
adjacent to some vertex in S. The total Î±-partial domination number of G, denoted by âˆ‚T Î±(G), is
the smallest cardinality of a total Î±-partial dominating set in G. In this paper, we characterize the
total partial dominating sets in the join, corona, lexicographic and Cartesian products of graphs
and determine the exact values or sharp bounds of the corresponding total partial domination
number of these graphs.
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.