{"entities":{"Q6906740":{"pageid":20940103,"ns":120,"title":"Item:Q6906740","lastrevid":84168029,"modified":"2026-05-12T22:33:40Z","type":"item","id":"Q6906740","labels":{"en":{"language":"en","value":"On weak double Roman domination in graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8115088"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$7D823863-803E-49B1-9465-E9036D4556AC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e9fd6fb3fd39524bd937874cf6ba426f4ae78328","datavalue":{"value":{"text":"On weak double Roman domination in graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6906740$0C49907A-5BED-4AFC-A878-C4226C307D3B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e3dcd2e99e82c62a6f2ce30ad245e825a2222697","datavalue":{"value":"10.1016/J.DAM.2025.07.019","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6906740$645700CD-D98C-484F-A9BD-F65F034E216F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"fef59897dedfafba61f5205954a419586c6c925b","datavalue":{"value":{"entity-type":"item","numeric-id":405423,"id":"Q405423"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$0FEC2951-43A9-42D1-937D-48F5E97D9547","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"99daa9c6ad6a7adc6aab5563d173fc645a1dbf2a","datavalue":{"value":{"entity-type":"item","numeric-id":251498,"id":"Q251498"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$4FDC24CB-9B6C-4E66-9621-BE828A15E2E8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fb0ee59d7fc23abc46aea0893d88cccc18c1b36b","datavalue":{"value":{"entity-type":"item","numeric-id":1630921,"id":"Q1630921"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$6ABC3F76-6233-4028-9C3A-A0045EF623AC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e0bc7ecb6470044ffd4ba0182ffc72809f8010a9","datavalue":{"value":{"entity-type":"item","numeric-id":630191,"id":"Q630191"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$A4A526A6-855E-4CF4-94C3-0D22C492DAB3","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"a30223844408826b2507023875c825df146c19cd","datavalue":{"value":"S. Soltani","type":"string"},"datatype":"string"},"type":"statement","id":"Q6906740$BB2D4ED7-C756-4903-AA02-479885C7DB8C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"087f55844cc920aae060b09644168bf17b022e1a","datavalue":{"value":{"entity-type":"item","numeric-id":96294,"id":"Q96294"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$54E9E937-B9C0-4D12-B6A1-D12206B2AEF8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"57d1246c8339bcdec3a59483c632c6d106ca03b0","datavalue":{"value":{"time":"+2025-11-04T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6906740$72CB491C-C7D5-4F56-A8E3-06F49D1AC0E6","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"8db9e7c626fd2ee3f30adfe638a67a48ab94e2c9","datavalue":{"value":"The dominating functions under investigation here have their historical origin in Roman defense strategies, (cf.\\ [\\textit{R. A. Beeler} et al., Discrete Appl. Math. 211, 23--29 (2016; Zbl 1348.05146)]). For a graph \\(G=(V,E)\\), a double Roman dominating function \\(f_0:V\\to\\{0,1,2,3\\}\\) is constrained as follows for each \\(v\\in V\\): if \\(f_0(v)=0\\), then \\(f_0\\) must assign either (i) to at least two neighbors of \\(v\\) the value 2, or (ii) to at least one neighbor the value 3; and, if \\(f_0(v)=1\\), then \\(f_0\\) must assign to at least one neighbor of \\(v\\) a value not less than 2. The authors apply a less restrictive variant -- the weak double Roman dominating function (WDRD-function) \\(f:V\\to\\{0,1,2,3\\}\\) -- which they introduced in [\\textit{S. Soltani} et al., Bull. Malays. Math. Sci. Soc. (2) 47, No. 6, Paper No. 184, 18 p. (2024; Zbl 1557.05123)]; the weight of \\(f\\) is \\(\\sum_{v\\in V}f(v)\\), and the weak double Roman domination number \\(\\gamma_{\\mathrm{wdR}}(G)\\) equals the minimum weight of any WDRD-function on \\(G\\). The weak function is constrained as follows: when \\(f(v)\\le1\\) for \\(v\\in V\\), there must exist a neighbor \\(u\\) of \\(v\\) with \\(f(u)\\ge2\\), such that the modified function \\(g:V\\to\\{0,1,2,3\\}\\) defined by \\(g(v)=f(v)+1\\), \\(g(u)=f(u)-1\\) and \\(g(x)=f(x)\\) for all \\(x\\in V\\) other than \\(u\\) and \\(v\\), has no doubly unprotected vertex \\(w\\) -- i.e. such that \\(\\sum_{x\\in N[w]}g(x)>1\\) for all \\(w\\in V\\) (where \\(N[w]\\) denotes the closed neighborhood of \\(w\\), consisting of \\(w\\) and all vertices adjacent to \\(w\\)). A bipartite graph \\(G=(X,Y,E)\\) is tree convex if a tree \\(T=(X,F)\\) can be defined such that the neighbors of any \\(y\\in Y\\) induce a subtree in \\(T\\); \\(G\\) is star convex if \\(T\\) is a star.\\N\\NHaving proved, in Theorem 5 of [Soltani et al., loc. cit.], that the weak double Roman domination problem (WDRD) is NP-complete for bipartite graphs, the authors now ask, in the instance of a nonempty star convex bipartite graph \\(G\\) and a positive integer \\(r\\), whether \\(G\\) has a WDRD-function of weight at most \\(r\\); they prove Theorem 1: The problem WDRD is NP-complete for star convex bipartite graphs. Theorem 4 addresses part of Problem 4 in \\S6 of the earlier paper, to characterize nontrivial trees \\(T_1\\) where the minimum cardinality of any dominating set, \\(\\gamma(T_1)\\), is equal to \\(\\frac12\\gamma_{\\mathrm{wdR}}(T_1)\\). For perfect binary trees, the authors determine the exact value of \\(\\gamma_{\\mathrm{wdR}}\\) in Theorem 8: For any perfect binary tree \\(T_2\\) in which each internal vertex has two children, and all leaves have depth \\(k\\ge1\\), \\(\\gamma_{\\mathrm{wdR}}(T_2)=3\\left(2^2+2^5+\\dots+2^{k-1}\\right)+2\\) if \\(k\\equiv0\\pmod 3\\); \\(\\gamma_{\\mathrm{wdR}}(T_2)=3\\left(2^0+2^3+\\dots+2^{k-1}\\right)\\) if \\(k\\equiv1\\pmod3\\); \\(\\gamma_{\\mathrm{wdR}}(T_2)=3\\left(2^1+2^4+2^7+\\dots+2^{k-1}\\right)\\) if \\(k\\equiv2\\pmod3\\). Moreover, \\(T_2\\) has a unique \\(\\gamma_{\\mathrm{wdR}}(T_2)\\)-function when \\(k\\equiv1,2\\pmod3\\), and \\(T_2\\) has exactly three \\(\\gamma_{\\mathrm{wdR}}(T_2)\\)-functions when \\(k\\equiv0\\pmod 3\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q6906740$BEC72759-21D2-47C8-BE27-CB70EC2F5F22","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"7d410aa128a8b8a63913c9594604f4ec3d0ad8b4","datavalue":{"value":{"entity-type":"item","numeric-id":590664,"id":"Q590664"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$A9EAA4CA-8651-41AE-B613-AEADFFD0AF9A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"cb1e2924ba238bc47b6e89cc71d65b0484b3d905","datavalue":{"value":"05C69","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6906740$881C65E9-656E-4556-A24C-D49C39D9EF6B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6906740$1B3FC4D1-55FA-41F9-A228-20A905061FD1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6906740$AF2F7723-A92F-4130-9CC7-F0B9C71B3998","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4054401f611c1b19f0863f6aa14590cc8e4b02f1","datavalue":{"value":"8115088","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6906740$F2E70BE2-47E1-40DB-8A7A-D772BE30E9B6","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6fd0e402d8866fbb26f832f7436133cee433e0ab","datavalue":{"value":"weak double Roman domination","type":"string"},"datatype":"string"},"type":"statement","id":"Q6906740$B93249BD-25F9-4A68-95BF-CDB064C24AD1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"adfbb9478253def407386004e0c70771203f9b5d","datavalue":{"value":"star convex bipartite graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q6906740$B576F780-F688-42CE-8D68-9CCA1AC9BBAA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c24938459dbf20196734dcf6c3a35c8a8724abee","datavalue":{"value":"trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q6906740$FC571144-07A9-4903-ACA9-2D83DF4844A8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4b717c6e9042ac30f8b08cab8f9a71bf58c5fa3f","datavalue":{"value":"perfect binary trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q6906740$4C09687D-EC05-496F-ABBF-A93CF0C2FFED","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$505125C8-7EEC-4380-83EA-148DFC9F9131","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"1fbcf5bb1c88e7b8acd628c82102e70df207cc9c","datavalue":{"value":{"entity-type":"item","numeric-id":6150904,"id":"Q6150904"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$E3CE4367-C457-476B-9EFE-2D9799193384","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"0acdb158ef6aa906211a46e1372a459caaff11f5","datavalue":{"value":{"entity-type":"item","numeric-id":335328,"id":"Q335328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$279A6A94-8AD7-4BA5-8246-015EA4D839CB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d88b4aef415d8ddb73eca7a4196387103ce972c5","datavalue":{"value":{"entity-type":"item","numeric-id":2115152,"id":"Q2115152"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$CD5F6E54-5949-4D27-A793-16B5B572A342","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f2a7168897650310e2b0aed0ee896fbb1fafb5d6","datavalue":{"value":{"entity-type":"item","numeric-id":5854749,"id":"Q5854749"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$81190C61-801A-4DEC-831C-096E7257E8AD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d7416bb868e2643e5168bd5bf1249d1690b1b55d","datavalue":{"value":{"entity-type":"item","numeric-id":6149323,"id":"Q6149323"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$4B2BCCE8-A8A2-4EE3-82E4-C83259A67065","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"6fd5264d6e8bffd436ed852c537a1bfd12c97ee3","datavalue":{"value":{"entity-type":"item","numeric-id":2096308,"id":"Q2096308"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$C5E554C3-5A55-4792-B931-9F9E9505CA37","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"74624f39bf0e7ff105aa24b239fd10e64193f1cb","datavalue":{"value":{"entity-type":"item","numeric-id":6122419,"id":"Q6122419"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$86C646FA-CF27-4FFB-9B92-ECC62B151330","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"dd0b94e00dbf17a5bde1042752934ff767ba834a","datavalue":{"value":{"entity-type":"item","numeric-id":6639835,"id":"Q6639835"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6906740$7CEDC1F1-95B2-46F2-93AB-24C9E8B4F04B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On weak double Roman domination in graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_weak_double_Roman_domination_in_graphs"}}}}}