{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T05:19:31Z","timestamp":1695791971504},"reference-count":5,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":8525,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1983,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A net is a graph in which each point and line is given a sign. The point, line, and simple duals of a net are obtained by reversing the signs of the points, lines, or both. If a net possesses two of the three types of self\u2010duality, it possesses all three and is said to be doubly self\u2010dual. Enumeration formulas are derived for nets and point, line, simply, and doubly self\u2010dual nets, whose underlying graphs are acyclic and unicyclic. The numbers are tabulated up to 12 points (24 for doubly self\u2010dual nets) in each case.<\/jats:p>","DOI":"10.1002\/jgt.3190070214","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T07:05:16Z","timestamp":1180422316000},"page":"241-260","source":"Crossref","is-referenced-by-count":0,"title":["Enumeration of acyclic and unicyclic nets with four types of self\u2010duality"],"prefix":"10.1002","volume":"7","author":[{"given":"Fred","family":"Holroyd","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(67)80052-8"},{"key":"e_1_2_1_3_2","volume-title":"Graphical Enumeration","author":"Harary F.","year":"1973"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010405"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02559543"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010406"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190070214","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190070214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T23:28:01Z","timestamp":1695770881000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190070214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["10.1002\/jgt.3190070214"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190070214","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}