{"entities":{"Q4009755":{"pageid":6039553,"ns":120,"title":"Item:Q4009755","lastrevid":81445328,"modified":"2026-05-06T18:32:16Z","type":"item","id":"Q4009755","labels":{"en":{"language":"en","value":"An algorithm for the classification of strongly regular graphs by means of lexically ordered adjacency matrices"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 61670"}},"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":"Q4009755$FDF2047E-21DC-4541-B38C-A50F71B44C7A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"35a41ac626d9618dcffa961052144f95599d4b98","datavalue":{"value":{"text":"An algorithm for the classification of strongly regular graphs by means of lexically ordered adjacency matrices","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4009755$4D95595D-3078-49BE-BAD0-11AA684E7102","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"2a03a41c4fa55d1ceebaa3ff1e41e7519ae6808e","datavalue":{"value":"0825.68487","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4009755$573A033F-A08C-4B4C-AC14-9EC7C91AF566","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ddb550487e65123cf01720e513251890e886e814","datavalue":{"value":"10.1080/00207169008803846","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4009755$355ADBD4-3BB1-42C9-8BDA-B087C1D75C43","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"8aaacd78950c77eb69fa64200ec40df61d5e386a","datavalue":{"value":{"entity-type":"item","numeric-id":405085,"id":"Q405085"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4009755$94D755F6-69B2-49D1-8731-462ED26638E1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6817d745d4e2b15a1fd57742e7d04acffc708bfd","datavalue":{"value":{"entity-type":"item","numeric-id":851772,"id":"Q851772"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4009755$39F776E4-8704-448C-9B54-E9C0E903D231","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"1f8a1cf422dc8a39955e3a7180ef4ce8229538d6","datavalue":{"value":{"entity-type":"item","numeric-id":2710741,"id":"Q2710741"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4009755$84B4AD5D-9FA6-4AF8-AC0E-09D28D51F30A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5fd62271fe98c7ff9916cafed51cf35315eeeb31","datavalue":{"value":{"time":"+1992-09-27T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4009755$D6D6528B-CED2-4269-A2D6-E6F752DB175A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4009755$BC3602E8-0109-4A22-AEBF-5ABAA1480BED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4009755$CA84F358-0CD5-4075-8C6F-9FB0B9439490","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c9121956be458a70e73e7749265b141c3c6621c6","datavalue":{"value":"61670","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4009755$BECDB6CA-4622-4A73-A63D-7147261EF605","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":"Q4009755$2A3D7D1B-4CE5-42A0-99F8-A917AF3BF80D","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"0087bf9aba64f98f729de58a80b2e616ed33dfbf","datavalue":{"value":"https://doi.org/10.1080/00207169008803846","type":"string"},"datatype":"url"},"type":"statement","id":"Q4009755$E214EBFC-824F-4BF9-8C44-A4A7F6325635","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"48c9c7769f178669ac568fe39e5384e29f6d746b","datavalue":{"value":"W2062996107","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4009755$1DE66FE7-9903-412E-B78B-89F93F02D716","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"af94fecf0a7f1dd34b1a1f4d366288444a9955fa","datavalue":{"value":{"entity-type":"item","numeric-id":2626247,"id":"Q2626247"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4009755$A700D5A4-9D86-459B-BC33-EA0E112B9FA5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7e40355e4d4cdcf361345495829f2e4cee0681ec","datavalue":{"value":{"entity-type":"item","numeric-id":1219303,"id":"Q1219303"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4009755$BEC8941E-EA99-4D11-9178-A8B5D2149D0F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for the classification of strongly regular graphs by means of lexically ordered adjacency matrices","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_algorithm_for_the_classification_of_strongly_regular_graphs_by_means_of_lexically_ordered_adjacency_matrices"}}}}}