Secure Inverse Domination in the Join of Graphs
Jesica P. Dagodog -, Enrico L. Enriquez · International Journal of Latest Engineering Research and Applications (IJLERA) · 2024
Let G be a connected simple graph and let D be a minimum dominating set of G.A dominating setIn this paper, the researchers initiate a study of the concept of secure inverse domination in graphs and characterize the secure inverse dominating set in the join of two connected simple graphs.