Affiliation:
1. University of Baghda
2. University of Technology, Baghdad
Abstract
Let G be a finite, simple graph, without isolated vertices. For any non-negative integers x and y, a set D ⊆ V is a ”pitchfork dominating set pds”, when every vertex in D, dominates at most y and at least x vertices of V − D. A subset D−1 of V − D is an inverse pds if it is a pitchfork set. The pitchfork domination number of G, γpf (G), is the number of elements of a smallest pds. The ”inverse pitchfork domination number” of G, γ −1 pf (G), is the number of elements of a smallest inverse pds. In this paper, some modified pitchfork dominations and its inverse dominations are introduced when x = 1 and y = 2. Several bounds and properties are given and proved. Then, these modified dominations are applied on some standard graphs such as: path, cycle, wheel, complete, complete bipartite graph and their complements.
Publisher
Sociedade Paranaense de Matematica
Reference18 articles.
1. M. A. Abdlhusein and M. N. Al-harere, New parameter of inverse domination in graphs, Indian Journal of Pure and Applied Mathematics, accepted to appear (2020). https://doi.org/10.1007/s13226-021-00082-z
2. M. A. Abdlhusein and M. N. Al-harere, Pitchfork domination and it's inverse for corona and join operations in graphs, Proceedings of International Mathematical Sciences, I, 2, 51-55, (2019).
3. M. A. Abdlhusein and M. N. Al-Harere, Doubly connected pitchfork domination and its inverse in graphs, TWMS J. App. Eng. Math., (accepted to appear) (2020). https://doi.org/10.1142/S1793830921500385
4. M. N. Al-harere and M. A. Abdlhusein, Pitchfork domination in graphs, Discrete Mathematics, Algorthem and Applications, 12, 2, 2050025, (2020). https://doi.org/10.1142/S1793830920500251
5. M. N. Al-harere and A. T. Breesam, Variant types of domination in spinner graph, Al-Nahrain Journal, 2, 127-133, (2019). https://doi.org/10.22401/ANJS.00.2.18