{"entities":{"Q1849997":{"pageid":1860739,"ns":120,"title":"Item:Q1849997","lastrevid":69353472,"modified":"2026-04-13T06:26:24Z","type":"item","id":"Q1849997","labels":{"en":{"language":"en","value":"On the number of edges in graphs with a given weakly connected domination number"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1838978"}},"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":"Q1849997$62350FBC-C644-41D0-9E81-DDDB22232E16","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f5d174ec348a260f8ebf82e4279d00edd852e74f","datavalue":{"value":{"text":"On the number of edges in graphs with a given weakly connected domination number","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1849997$6063B43B-2575-4259-96A7-906878493A7F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"66282c74515d38fd562c248589557aca96cac438","datavalue":{"value":"1008.05113","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1849997$0A0BCE8A-E53B-4748-8E3E-017C28CC5427","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4b29e25c973489f38bff055dbd2252b83e81e446","datavalue":{"value":"10.1016/S0012-365X(01)00474-5","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1849997$45B44A36-F39D-4181-8CBE-3146F3EEEBAD","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b09bb5809f22b0c7500a2ef34c355902663eb05e","datavalue":{"value":{"entity-type":"item","numeric-id":241138,"id":"Q241138"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1849997$832A96C6-F928-45F5-B94F-F37C6CFA57B2","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"38665fe4ed2b835132254a58832c329597060029","datavalue":{"value":{"entity-type":"item","numeric-id":175483,"id":"Q175483"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1849997$92BBF06B-81E5-411F-A043-089A2227F5AC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"82ac30fadc544187fd268bb88e1da4be75a5ee8c","datavalue":{"value":{"time":"+2002-12-02T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1849997$95C00EEA-FF3E-4298-A54F-05F602ACAADD","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"3a7b6dbf1248d362e9adaf96f987519f2eb8793f","datavalue":{"value":"A subset \\(D\\) of the vertex set \\(V(G)\\) of a graph \\(G\\) is called a dominating set in \\(G\\), if it has the property that each vertex of \\(G\\) either is in \\(D\\), or is adjacent to a vertex of \\(D\\). If, moreover, the set of edges incident with no vertex of \\(D\\) does not separate the graph \\(G\\), the set \\(D\\) is a weakly connected dominating set in \\(G\\). The minimum cardinality of such a set is the weakly connected domination number \\(\\gamma_w(G)\\) of \\(G\\). The paper determines \\(\\left(\\begin{smallmatrix} n-d+1\\\\ 2\\end{smallmatrix}\\right)\\) as the maximum number of edges a graph \\(G\\) with \\(n\\) vertices and with \\(\\gamma_w(G)= d\\geq 3\\) can have.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1849997$999FA769-269E-4ED1-B8BC-B6F734BF6A6E","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"d9b462d071c33d7d83486f9fef57845bb41d7acf","datavalue":{"value":{"entity-type":"item","numeric-id":190573,"id":"Q190573"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1849997$687A670A-E2FC-45B9-AC71-CC291643E985","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"cb1e2924ba238bc47b6e89cc71d65b0484b3d905","datavalue":{"value":"05C69","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1849997$D847A323-FCFB-4791-A685-DC9FD91EB39F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"da3c97b7845c2200321c9b13221063f55f504b3c","datavalue":{"value":"1838978","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1849997$AB9E7CBD-D1D5-4595-A4FF-C56D806FF8C0","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0945305d014a34d75b234762c46b2eee32819a94","datavalue":{"value":"weakly connected","type":"string"},"datatype":"string"},"type":"statement","id":"Q1849997$EDA80589-1461-4189-A1B1-BEFB5B0455A6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3267d14ab3c644208190b057ee58cacbeb7fa5c7","datavalue":{"value":"domination number","type":"string"},"datatype":"string"},"type":"statement","id":"Q1849997$EFF6020C-3AE0-42C7-8089-9655EA149596","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":"Q1849997$2AD5EA60-AECC-496E-BD7B-96B480D95EA5","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"2ce9f0c844635e3051c402f912cf3dccb0206545","datavalue":{"value":"https://doi.org/10.1016/s0012-365x(01)00474-5","type":"string"},"datatype":"url"},"type":"statement","id":"Q1849997$414B32A4-D11D-4E3D-A94B-F3A700648CAC","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"e0f71a4a72f269f72b356ffc257e69bfea45b5f9","datavalue":{"value":"W4213244352","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1849997$ADEFF8AB-CDEB-4DD5-8271-2339AFC395DF","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0ded564fc36458e2a9296690bdc1b20ada82d807","datavalue":{"value":{"entity-type":"item","numeric-id":3527530,"id":"Q3527530"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2e6a5d9d5fa73dfb7ff5dcb6952a3634e43d4d1d","datavalue":{"value":{"amount":"+0.8887904286384583","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1849997$2D1C812F-FA99-4A24-8613-D6D57F7C578C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0a22c1cfa349aa19ca5ca2e8d95c2e49e61c08da","datavalue":{"value":{"entity-type":"item","numeric-id":3621544,"id":"Q3621544"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ad581cfc2a3207fdae91399af0e8cfcfad0126c6","datavalue":{"value":{"amount":"+0.8804880976676941","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1849997$4482C4C9-57E2-490C-9C9B-D5372432379A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a5dbd6d162d44076384e5f1850d71e2ac82a1ca7","datavalue":{"value":{"entity-type":"item","numeric-id":1356466,"id":"Q1356466"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ee42cdeeec86673582f9efbb2a2cc4d61ecdd431","datavalue":{"value":{"amount":"+0.8730568885803223","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1849997$07BD8A6A-CEA1-4C77-90FE-A4783A297089","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"48711d9c97f95c1f0149c2362b2811cceab19388","datavalue":{"value":{"entity-type":"item","numeric-id":3115009,"id":"Q3115009"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e5be04c5e9640fdfab072f2a50370a2dbdc86a58","datavalue":{"value":{"amount":"+0.8689029812812805","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1849997$0391FA15-D169-49B9-AD55-0097E16FCB75","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"42eeb296ecae752e908a62b5432439f57288733f","datavalue":{"value":{"entity-type":"item","numeric-id":2581406,"id":"Q2581406"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2b4da356232dcf8781327302ab683759fe5f07e5","datavalue":{"value":{"amount":"+0.8674938678741455","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1849997$69B9E3AB-EAB5-4915-A394-A41846A685E8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the number of edges in graphs with a given weakly connected domination number","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_number_of_edges_in_graphs_with_a_given_weakly_connected_domination_number"}}}}}