On Semitotal k-Fair and Independent k-Fair Domination in Graphs
-
Published:2020-10-31
Issue:4
Volume:13
Page:779-793
-
ISSN:1307-5543
-
Container-title:European Journal of Pure and Applied Mathematics
-
language:
-
Short-container-title:Eur. J. Pure Appl. Math.
Author:
Ortega Marivir,Isla Rowena
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.
Publisher
New York Business Global LLC
Subject
Applied Mathematics,Geometry and Topology,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,Theoretical Computer Science
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Restrained Global Defensive Alliances in Graphs;European Journal of Pure and Applied Mathematics;2024-07-31
2. On k-Fair Total Domination in Graphs;European Journal of Pure and Applied Mathematics;2021-05-18