On Semitotal k-Fair and Independent k-Fair Domination in Graphs

Authors

  • Marivir Ortega Department of Mathematics and Statistics, College of Science and Mathematics, Mindanao State University-Iligan Institute of Technology, 9200 Iligan City, Philippines
  • Rowena Isla Department of Mathematics and Statistics, College of Science and Mathematics, Mindanao State University-Iligan Institute of Technology, 9200 Iligan City, Philippines

DOI:

https://doi.org/10.29020/nybg.ejpam.v13i4.3812

Keywords:

Semitotal domination, Independent domination, $k$-Fair domination, Join, Corona, Lexicographic product, Cartesian product

Abstract

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

2020-10-31

Issue

Vol. 13 No. 4: (October 2020)

Section

Nonlinear Analysis

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.

How to Cite

On Semitotal k-Fair and Independent k-Fair Domination in Graphs. (2020). European Journal of Pure and Applied Mathematics, 13(4), 779-793. https://doi.org/10.29020/nybg.ejpam.v13i4.3812

Similar Articles

1-10 of 205

You may also start an advanced similarity search for this article.