{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:42:53Z","timestamp":1648939373526},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1980,1,1]],"date-time":"1980-01-01T00:00:00Z","timestamp":315532800000},"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":12251,"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":[[1980]]},"DOI":"10.1016\/0012-365x(80)90048-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"99-103","source":"Crossref","is-referenced-by-count":0,"title":["Edge cosymmetric graphs"],"prefix":"10.1016","volume":"32","author":[{"given":"David","family":"Burns","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.F.","family":"Kapoor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.A.","family":"Ostrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(80)90048-5_BIB1","series-title":"Graphs and Diagraphs","author":"Behzad","year":"1979"},{"key":"10.1016\/0012-365X(80)90048-5_BIB2","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0095-8956(72)90030-5","article-title":"On edge but not vertex transitive regular graphs","volume":"12","author":"Bouwer","year":"1972","journal-title":"J. Combinatorial Theory (Ser. B)"},{"key":"10.1016\/0012-365X(80)90048-5_BIB3","unstructured":"D. Burns, S.F. Kapoor, and P.A. Ostrand, Uniquely edge extendible graphs: I (submitted)."},{"key":"10.1016\/0012-365X(80)90048-5_BIB4","unstructured":"D. Burns, S.F. Kapoor, and P.A. Ostrand, Line-symmetric graphs (submitted)."},{"key":"10.1016\/0012-365X(80)90048-5_BIB5","series-title":"Graph Theory, Coding Theory, and Block Designs","author":"Cameron","year":"1975"},{"key":"10.1016\/0012-365X(80)90048-5_BIB6","unstructured":"E. Dauber and F. Harary, On point-symmetric and line-symmetric graphs (unpublished manuscript)."},{"key":"10.1016\/0012-365X(80)90048-5_BIB7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0021-9800(67)80069-3","article-title":"Regular line-symmetric graphs","volume":"3","author":"Folkman","year":"1967","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0012-365X(80)90048-5_BIB8","series-title":"Graph Theory","author":"Harary","year":"1969"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X80900485?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X80900485?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:25:34Z","timestamp":1555140334000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X80900485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980]]}},"alternative-id":["0012365X80900485"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(80)90048-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1980]]}}}