Year: 2025
Type: article
Abstract: Let X = V (G) \ S, where S is a γri-set of G.A subset Y ⊆ X is said to be an inverse rings dominating set of G with respect to S if Y is a rings dominating set of G.The minimum cardinality of an inverse rings dominating set of G with respect to a γri-set S of G is said to be an inverse rings domination number of G with respect to a γri-set S of G, and we denote such asIn this study, we show that the graph may have a rings dominating set and no inverse rings dominating set.Moreover, we study the inverse rings dominating set in the join and corona of graphs.2020 Mathematics Subject Classification.05C69; 05C38.Key words and phrases.dominating set
DOI: 10.28924/apjm/12-88
Authors: Leah C. Martin-Lundag, Mark L. Caay
Institutions: Adamson University, Polytechnic University of the Philippines
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4414715214
FWCI:
Cites:
Cited by:
Related to: