Secure Equitability in Chemical Networks
benzoid; chemical networks; Secure equitable domination; silicate
Let G (V,E) be a simple connected graph with a set of nodes V(G) and a set of edges E(G). A secure equitable dominating set [Formula Presented] is a dominating set in which, for any vertex [Formula Presented], there exists at least one vertex [Formula Presented] such that the vertex u belongs to the equitable neighborhood of v and, if we swap the vertices u and v, then the equitable domination property of the graph does not change. A secure equitable dominating set of minimum number of nodes in G is named a [Formula Presented] -set and the cardinality of a [Formula Presented] -set is called the secure equitable domination number of G, denoted by [Formula Presented]. In this paper, we study the bounds of secure equitable domination number in certain chemical structures. Moreover, we give an application of the parameter on interconnection networks. 2026 Scrivener Publishing LLC.
Graph Theory in Computer Science;pp.201-211
Restricted Access; Hardcopy may be available in the library
https://doi.org/10.1002/9781394302628.ch11 https://www.scopus.com/pages/publications/105028340302?origin=resultslist
Alex A., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bengaluru, India; Sangeetha V., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bengaluru, India