Total Partial Domination in Graphs Under Some Binary Operations
DOI:
https://doi.org/10.29020/nybg.ejpam.v12i4.3554Abstract
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.
Downloads
Published
Issue
Section
License
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.