{"entities":{"Q5540279":{"pageid":7569839,"ns":120,"title":"Item:Q5540279","lastrevid":101433659,"modified":"2026-06-06T01:15:53Z","type":"item","id":"Q5540279","labels":{"en":{"language":"en","value":"The least number of edges for graphs having symmetric automorphism group"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3253787"}},"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":"Q5540279$975D7B91-9CE8-43BD-99D5-819224690A6F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ffb8871a905fbceac0f2499602ba3b6bbc93df26","datavalue":{"value":{"text":"The least number of edges for graphs having symmetric automorphism group","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5540279$BA84B53B-6D34-45C3-B2E5-03B443F3DADE","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"dd1d5eeaa8a0621a686feec71c2505b56856bbe5","datavalue":{"value":"0157.55004","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5540279$95D26D1A-5531-4C9B-A152-8C4B4581F7EE","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c0d9aef6a3f847df868a1938327cc75bc9789323","datavalue":{"value":"10.1016/S0021-9800(68)80046-8","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5540279$B66A26F6-8CCF-489B-8839-68966160F19A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"82f1db23e4145636c0deb11b3cf3f30cc26e8f15","datavalue":{"value":{"entity-type":"item","numeric-id":685645,"id":"Q685645"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5540279$18792517-9A37-4DFF-8FF2-A9788E824A60","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"2a320074a4e9d140b582de7653dd3aa3bbba1e48","datavalue":{"value":{"entity-type":"item","numeric-id":113487,"id":"Q113487"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5540279$EB6F2E2E-F674-4FF8-B421-93D491775187","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6b7d902a691bf065ccbbbe3c070a7f8cb1f53366","datavalue":{"value":{"time":"+1968-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5540279$98BCEE3C-CB26-40F6-95B8-3C92B44A1A4D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e693fd1d692d86efa8add08b5c263fb9fb6e19fa","datavalue":{"value":"3253787","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5540279$12A9C59C-21E6-4345-A2A0-9EF2BDC5AD27","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"96a810129b114a6942442a7fc510c6873bd89ff8","datavalue":{"value":"topology","type":"string"},"datatype":"string"},"type":"statement","id":"Q5540279$959A95AC-BB6F-4920-98FB-25F51EADCE3D","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":"Q5540279$ED7B9173-9365-4F5B-819D-B7D2EE4C4E14","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The least number of edges for graphs having symmetric automorphism group","badges":[]}}}}}