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 Joseph, James; Joseph, Mayamma Title A name given to the resource Edge criticality in signed graphs admitting a Roman dominating function 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 Art of Discrete and Applied Mathematics; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.26493/2590-9770.1833.d92" target="_blank" rel="noreferrer noopener">https://doi.org/10.26493/2590-9770.1833.d92</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105017653688?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105017653688?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 Joseph J., CHRIST (Deemed to be University), Bangalore, 560029, India; Joseph M., CHRIST (Deemed to be University), Bangalore, 560029, India Description An account of the resource A Roman dominating function(RDF) on a signed graph S = (G, ?) is a function f: V (S) ? {0, 1, 2} such that f(N[v]) ? 1 for every vertex v ? V (S) and any vertex v with f(v) = 0 has a neighbour u ? N + P (v) having f(u) = 2, where f(N[v]) = f(v) + ?u?N(v) ?(uv)f(u). The weight of an RDF is ?(f) = ?v?V f(v) and the minimum weight among all the RDFs on S is called the Roman domination number, ?R(S). In this article we explore the concept of edge criticality in signed graphs admitting an RDF by examining the signed graphs S such that ?R(S+uv) &lt; ?R(S), for any pair of non-adjacent vertices u and v of S, such that the edge uv is positive. This work is licensed under https://creativecommons.org/licenses/by/4.0/ Subject The topic of the resource roman dominating function; roman domination edge critical graphs; roman domination number; Signed graphs Publisher An entity responsible for making the resource available University of Primorska Relation A related resource ISSN: 25909770; 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 All Open Access; Gold Open Access Format The file format, physical medium, or dimensions of the resource online