{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T11:06:26Z","timestamp":1775473586395,"version":"3.50.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1973,9,1]],"date-time":"1973-09-01T00:00:00Z","timestamp":115689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":14564,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1973,9]]},"DOI":"10.1016\/0012-365x(73)90036-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"53-78","source":"Crossref","is-referenced-by-count":14,"title":["The least number of edges for graphs having dihedral automorphism group"],"prefix":"10.1016","volume":"6","author":[{"given":"Gary","family":"Haggard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(73)90036-8_BIB1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02559543","article-title":"The number of homeomorphically irreducible trees and other species","volume":"101","author":"Harary","year":"1959","journal-title":"Acta Math."},{"key":"10.1016\/0012-365X(73)90036-8_BIB2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02546665","article-title":"Kombinatorische Anzahlbestimmungen f\u00fcr Gruppen, Graphen und chemische Verbindungen","volume":"68","author":"P\u00f3lya","year":"1937","journal-title":"Acta Math."},{"key":"10.1016\/0012-365X(73)90036-8_BIB3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0021-9800(67)80018-8","article-title":"Extrema concerning asymmetric graphs","volume":"3","author":"Quintas","year":"1967","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(73)90036-8_BIB4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0021-9800(68)80046-8","article-title":"The least number of edges for graphs having symmetric automorphism group","volume":"5","author":"Quintas","year":"1968","journal-title":"J. Combin. Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X73900368?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X73900368?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T10:51:56Z","timestamp":1555152716000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X73900368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,9]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1973,9]]}},"alternative-id":["0012365X73900368"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(73)90036-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1973,9]]}}}