Secure Inverse Domination in the Corona and Lexicographic Product of Two Graphs

As secure domination and inverse domination garnered attention from various researchers, the combination of the two also raised a certain amount of curiosity. This paper aimed to investigate the secure inverse domination in graphs which is defined as follows. Let G be a connected simple graph and let D be a minimum dominating set of G. A dominating set S⊆V (G) ∖D is an inverse dominating set of G with respect to D. The set S is called a secure inverse dominating set of G if for every u∈V (G) ∖S, there exists v∈S such that uv∈E (G) and the set (S∖v) ∪u is a dominating set of G. The secure inverse domination number of G, denoted by γₛ^ ( (-1) ) (G), is the minimum cardinality of a secure inverse dominating set of G. A secure inverse dominating set of cardinality γₛ^ ( (-1) ) (G) is called γₛ^ ( (-1) ) -set. Particularly, the researchers examined and provided the characterization of secure inverse dominating set in the corona and lexicographic product of two graphs in this study. Moreover, the secure inverse domination number of graphs under the binary operations corona and lexicographic product were determined.