• Publications
  • Influence
Fair total domination in the join, corona, and composition of graphs
is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work isExpand
  • 4
  • PDF
Fair domination in the join, corona and composition of graphs
In this paper, we characterize the fair dominating sets in the join, corona and composition of graphs. We also determine the bounds or exact values of the fair domination numbers of these graphs.Expand
  • 4
  • PDF
Total Partial Domination in Graphs Under Some Binary Operations
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 isExpand
Hyper Homomorphism and Hyper Product of Hyper UP-algebras
In this paper, we investigate the concept of regular congruence relation on hyper UP-algebras and establish some homomorphism theorems on such algebras. We also examine the notion of hyper product ofExpand
k-Fair domination in the join, corona, composition, and Cartesian product of graphs
In this paper, we characterize the k-fair dominating sets in the join, corona, composition, and Cartesian product of graphs. We also determine the bounds or exact values of the k-fair dominationExpand
  • 3
  • PDF
Neighborhood Connected k-Fair Domination Under Some Binary Operations
Let G=(V(G),E(G)) be a simple graph. A neighborhood connected k-fair dominating set (nckfd-set) is a dominating set S subset V(G) such that |N(u)  intersection S|=k for every u is an element ofExpand
  • 1
  • PDF
On Semitotal k-Fair and Independent k-Fair Domination in Graphs
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-fairExpand
...
1
2
...