{"entities":{"Q6257637":{"pageid":13394405,"ns":120,"title":"Item:Q6257637","lastrevid":94904918,"modified":"2026-06-05T07:56:05Z","type":"item","id":"Q6257637","labels":{"en":{"language":"en","value":"Counting the number of weakly connected dominating sets of graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900235620"}},"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":"Q6257637$2322D149-8310-4EC4-ABAF-DDFBAD880989","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d729c71ddc23c180ae0121cae4e58005487c803f","datavalue":{"value":{"time":"+2014-12-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6257637$63352F53-1B18-4BDE-A7B2-C10177DCF8A3","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"01bc004848444ad88855b47de686f076a5e41c51","datavalue":{"value":{"entity-type":"item","numeric-id":277497,"id":"Q277497"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6257637$ED421F7B-1505-4BD3-B5E3-B0B12E4B8020","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5946d582b0017bf4e0d48ad82cad5c0d9245fd7a","datavalue":{"value":{"entity-type":"item","numeric-id":471789,"id":"Q471789"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6257637$38F4D6D9-2739-4D90-AC9D-D3E43D104F59","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6beaf289666e05bd4b16ff3816954f60662bdcf7","datavalue":{"value":{"entity-type":"item","numeric-id":310691,"id":"Q310691"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6257637$A54C6167-6DA3-49FF-851E-C26A99B9B54B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6257637$859D1AFF-979B-417F-BA34-3EDEE2576330","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"cb1e2924ba238bc47b6e89cc71d65b0484b3d905","datavalue":{"value":"05C69","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6257637$FA709B6B-7DC1-4992-813D-A9709D8C1715","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"23132d424b96c47e1dc85f8baec24ac8e5043535","datavalue":{"value":"900235620","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6257637$A7F5DD6F-FEDD-420C-8121-56D63DEC16A0","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":"Q6257637$F399B505-C4C5-465D-99D3-254976BE710F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Counting the number of weakly connected dominating sets of graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Counting_the_number_of_weakly_connected_dominating_sets_of_graphs"}}}}}