Enrico L. Enriquez
Let G be a connected simple graph. A dominating subset S of V (G) is a fair dominating set of G if all the vertices not in S are dominated by the same number of vertices from S. Let D be a minimum fair dominating set of G. A fair dominating set S ⊆ (V (G)∖D) is called an inverse fair dominating set of G with respect to D. The inverse fair domination number of G denoted by γfd-1(G) is the minimum cardinality of an inverse fair dominating set of G. In this paper, we investigate the concept and give some important results. Further, we give the characterization of an inverse fair dominating set in the join and corona of two graphs. © 2024 World Scientific Publishing Company.
Department of Computer, Information Science and Mathematics, School of Arts and Sciences, University of San Carlos, Cebu City, 6000, Philippines
Research at a Glance
Register to unlock
Topics & SDG Alignment
Register to unlock
Collaboration
Register to unlock
Author Profile (Selected)
Register to unlock
References Overview
Register to unlock
Journal & Source
Register to unlock
Metadata & Integrity
Register to unlock