{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:25:13Z","timestamp":1753885513949,"version":"3.41.2"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p> Let G be a graph with a set of V vertices and a set of E edges. A function [Formula: see text] is called a restrained dominating function (RDF) of G if, for every [Formula: see text] [Formula: see text]. A restrained dominating function f of a graph G is called minimal (MRDF) if, for all functions [Formula: see text] such that [Formula: see text] and g(v) [Formula: see text] f(v) for at least one [Formula: see text] g is not a RDF. The fractional restrained domination number [Formula: see text] is defined as follows: [Formula: see text]: f is an MRDF of G[Formula: see text] where [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830924500046","type":"journal-article","created":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T08:29:51Z","timestamp":1707899391000},"source":"Crossref","is-referenced-by-count":0,"title":["Fractional restrained domination"],"prefix":"10.1142","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9272-4871","authenticated-orcid":false,"given":"P.","family":"Vijayalakshmi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Kalasalingam Academy of Research and Education, Tamil Nadu, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7119-0599","authenticated-orcid":false,"given":"K.","family":"Karuppasamy","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Kalasalingam Academy of Research and Education, Tamil Nadu, India"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2002-3528","authenticated-orcid":false,"given":"Tiji","family":"Thomas","sequence":"additional","affiliation":[{"name":"Department of Computer Applications, Mar Athanasios College for Advanced Studies, Kerala, India"}]}],"member":"219","published-online":{"date-parts":[[2024,2,9]]},"reference":[{"doi-asserted-by":"publisher","key":"S1793830924500046BIB001","DOI":"10.2298\/AADM0902359A"},{"doi-asserted-by":"publisher","key":"S1793830924500046BIB002","DOI":"10.7151\/dmgt.1474"},{"key":"S1793830924500046BIB003","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"1996","edition":"3"},{"doi-asserted-by":"publisher","key":"S1793830924500046BIB004","DOI":"10.1016\/0304-3975(80)90031-6"},{"doi-asserted-by":"publisher","key":"S1793830924500046BIB005","DOI":"10.1016\/S0012-365X(99)00016-3"},{"doi-asserted-by":"publisher","key":"S1793830924500046BIB006","DOI":"10.1016\/S0012-365X(99)00036-9"},{"volume-title":"Domination in Graphs, Advanced Topics","year":"1997","author":"Haynes T. W.","key":"S1793830924500046BIB007"},{"volume-title":"Fundamentals of Domination in Graphs","year":"1997","author":"Haynes T. W.","key":"S1793830924500046BIB008"},{"doi-asserted-by":"publisher","key":"S1793830924500046BIB009","DOI":"10.1016\/S0012-365X(98)00252-0"},{"doi-asserted-by":"publisher","key":"S1793830924500046BIB010","DOI":"10.1016\/j.tcs.2023.113832"},{"key":"S1793830924500046BIB011","series-title":"American Mathematical Society Colloquium Publications","volume-title":"Theory of Graphs","volume":"38","author":"Ore O.","year":"1662"},{"volume-title":"Fractional Graph Theory: A Rational Approach to the Theory of Graphs","year":"1997","author":"Scheinerman E. R.","key":"S1793830924500046BIB012"},{"doi-asserted-by":"publisher","key":"S1793830924500046BIB013","DOI":"10.3233\/JIFS-222999"},{"doi-asserted-by":"publisher","key":"S1793830924500046BIB014","DOI":"10.1137\/S0895480194275825"},{"doi-asserted-by":"publisher","key":"S1793830924500046BIB015","DOI":"10.26708\/IJMSC.2017.1.8.03"},{"issue":"1","key":"S1793830924500046BIB016","first-page":"1","volume":"8","author":"Volkmann L.","year":"2023","journal-title":"Commun. \u00a0Combin. Optim."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830924500046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:58:40Z","timestamp":1737507520000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830924500046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,9]]},"references-count":16,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1142\/S1793830924500046"],"URL":"https:\/\/doi.org\/10.1142\/s1793830924500046","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2024,2,9]]},"article-number":"2450004"}}