On Semitotal k-Fair and Independent k-Fair Domination in Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v13i4.3812Keywords:
Semitotal domination, Independent domination, $k$-Fair domination, Join, Corona, Lexicographic product, Cartesian productAbstract
In this paper, we introduce and investigate the concepts of semitotal k-fair domination and independent k-fair domination, where k is a positive integer. We also characterize the semitotal 1-fair dominating sets and independent k-fair dominating sets in the join, corona, lexicographic product, and Cartesian product of graphs and determine the exact value or sharp bounds of the corresponding semitotal 1-fair domination number and independent k-fair domination number.
Downloads
Published
How to Cite
Issue
Section
License
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.