ON THE SECURE EQUITABLE DOMINATION IN GRAPHS

Year 2025, Volume: 15 Issue: 9, 2156 - 2165, 01.09.2025

Annie Alex Sangeetha Shathish

Abstract

A secure equitable dominating set $S$ of a graph $G$ is a dominating set in which for any vertex $v \in V(G) \setminus S$ there exists at least one vertex $u \in S$ such that $u \in N_{e}(v)$, where $N_{e}(v)$ indicate the equitable neighbourhood of $v$, and if we swap the vertex $u$ with $v$, the equitable domination property of the graph will be unharmed. $\gamma_{sec}^{e}(G)$ represents the secure equitable domination number of $G$, which is the cardinality of the minimum secure equitable dominating set in $G$. The improved bounds of the secure equitable domination number of some fundamental kinds of graphs are established in this study. Furthermore, we incorporate specific results based on the diameter, girth, and degree. Additionally, we determine the bounds of the secure equitable domination number of specific special classes of graphs.

Keywords

Secure equitable domination , secure equitable domination number , wheel graphs , double-wheel graph , helm graph , flower graph , sunflower graph

References

• Annie, A. and Sangeetha, V., Secure equitable domination in Cartesian product of graphs, (to appear).
• Cockayne, E. J., Grobler, P. J. P., Grundlingh, W. R., Munganga, J. and Van Vuuren, J. H., (2005), Protection of a graph, Utilitas Mathematica, 67, pp. 19-32.
• Imani, E. and Mirzavaziri, M., (2022), Self-centered graphs with diameter 3, Khayyam J. Math., 8, pp. 17-24.
• Harary, F., (2001), Graph Theory, Narosa publications, New Delhi.
• Haynes, T. W., Hedetniemi, S. and P. Slater, (1998), Fundamentals of domination in graphs, CRC Press, United States.
• Michael, H. and Alex, N., (2022), The secure domination number of Cartesian products of small graphs with paths and cycles, Discrete Math., pp. 32-45.
• Muthusubramanian, L., Sundareswaran, R. and Swaminathan, V., (2022), Secure equitability in graphs, Discrete Math. Algorithms Appl., 2250081.
• Swaminathan, V. and Dharmalingam, K. M., (2011), Degree equitable domination on graphs, Kragujevac J. Math., 35(35), pp. 191-197.