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 Mathias, Anisha Jean; Sangeetha, Veerasamy; Acharya, Mukti Title A name given to the resource A study on the restrained domination number in diverse families of derived signed 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.;2550037; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S1793830925500375" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500375</a> <br /><br /><a href="https://www.scopus.com/pages/publications/86000649506?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/86000649506?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 Mathias A.J., Department of Mathematics, CHRIST (Deemed to Be University), Karnataka, Bengaluru, 560029, India; Sangeetha V., Department of Mathematics, CHRIST (Deemed to Be University), Karnataka, Bengaluru, 560029, India; Acharya M., Department of Mathematics, CHRIST (Deemed to Be University), Karnataka, Bengaluru, 560029, India Description An account of the resource A derived graph is obtained by applying a specific graph operation to a given graph G. A set D of vertices in a signed graph ? is a restrained dominating set of ? if D is a restrained dominating set of the underlying graph |?|, and every cycle formed by the edges connecting D to V \D and those within V \D is balanced. The restrained domination number ?r(?) is the minimum cardinality of a restrained dominating set of ?. In this paper, we establish results on the restrained domination number for derived signed graphs, including line signed graphs, semi-total point signed graphs, semi-total line signed graphs, and total signed graphs and we also examine their structural properties in relation to their restrained domination number. 2025 World Scientific Publishing Company. Subject The topic of the resource line signed graph; Restrained domination number; semi-total line signed graph; semi-total point signed graph; total signed graph 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