Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Faculty Publications Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Creator An entity primarily responsible for making the resource Annie, A.; Sangeetha, V. Title A name given to the resource ON THE SECURE EQUITABLE DOMINATION IN GRAPHS Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived Turkish World Mathematical Society Journal of Applied and Engineering Mathematics;Volume;15;Issue;9;pp.2156-2165 Identifier An unambiguous reference to the resource within a given context <a href="https://www.scopus.com/pages/publications/105015711771?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105015711771?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Annie A., Department of Mathematics, CHRIST(Deemed to be University), Karnataka, Bangalore, India; Sangeetha V., Department of Mathematics, CHRIST(Deemed to be University), Karnataka, Bangalore, India Description An account of the resource A secure equitable dominating set S of a graph G is a dominating set in which for any vertex v ? V (G) \ S there exists at least one vertex u ? S such that u ? Ne(v), where Ne(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. ?esec(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. I??k University, Department of Mathematics, 2025; all rights reserved. Subject The topic of the resource 05C05; 05C69; 05C76; flower graph; helm graph; Secure equitable domination; secure equitable domination number; sunflower graph; wheel graphs,double-wheel graph Publisher An entity responsible for making the resource available Isik University Relation A related resource ISSN: 21461147; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online