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 Alex, Annie; Sangeetha, V. Title A name given to the resource Secure equitable domination in Cartesian product of 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 Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550128; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S1793830925501289" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925501289</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105017178132?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105017178132?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 Alex A., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India; Sangeetha V., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India Description An account of the resource In graphs, several domination parameters have been introduced by incorporating a combination of the existing ones. A secure equitable domination is a domination in which the dominating set admits the properties of both; secure as well as equitable dominating sets. An equitable dominating set D of a graph G is said to be secure equitable dominating set, if for every u ? V?D, there exists a vertex v ? D such that u and v are adjacent and {D?{v}}?{u} is an equitable dominating set of G. The minimum cardinality of a secure equitable dominating set of G is called the secure equitable domination number of G. In this paper, we study certain cases were the secure domination, the equitable domination and the secure equitable domination bounds are equal. Moreover, we establish the bounds of secure equitable domination number of the Cartesian product of graphs. 2025 World Scientific Publishing Company. Subject The topic of the resource Cartesian product; Equitable domination; secure domination; secure equitable domination Publisher An entity responsible for making the resource available World Scientific Relation A related resource ISSN: 17938309; 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