{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:25:21Z","timestamp":1648880721202},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0012-365x(83)90126-7","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T17:00:52Z","timestamp":1032282052000},"page":"311-315","source":"Crossref","is-referenced-by-count":0,"title":["On labeled vertex-transitive digraphs with a prime number of vertices"],"prefix":"10.1016","volume":"46","author":[{"given":"Chong-Yun","family":"Chao","sequence":"first","affiliation":[]},{"given":"Jacqueline G.","family":"Wells","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(83)90126-7_BIB1","series-title":"Applied Combinatorial Mathematics","first-page":"144","article-title":"P\u00f3lya's theory of counting","author":"de Bruijn","year":"1964"},{"key":"10.1016\/0012-365X(83)90126-7_BIB2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0012-365X(74)90141-1","article-title":"A note on labeled symmetric graphs","volume":"8","author":"Chao","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(83)90126-7_BIB3","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/0095-8956(73)90007-5","article-title":"A class of vertex-transitive digraphs","volume":"14","author":"Chao","year":"1973","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/0012-365X(83)90126-7_BIB4","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0095-8956(82)90009-0","article-title":"A class of vertex-transitive digraphs II","volume":"32","author":"Chao","year":"1982","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/0012-365X(83)90126-7_BIB5","series-title":"Graphical Enumeration","author":"Harary","year":"1973"},{"key":"10.1016\/0012-365X(83)90126-7_BIB6","series-title":"Selected Topics in Graph Theory","first-page":"385","article-title":"The enumeration of graphs","author":"Palmer","year":"1978"},{"key":"10.1016\/0012-365X(83)90126-7_BIB7","series-title":"Graph Theory and Theoretical Physics","article-title":"Some applications of a theorem of de Bruijn","author":"Read","year":"1967"},{"key":"10.1016\/0012-365X(83)90126-7_BIB8","first-page":"156","article-title":"Counting graphs with a duality property","volume":"Vol. 52","author":"Robinson","year":"1981"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83901267?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83901267?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T16:24:27Z","timestamp":1554827067000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X83901267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0012365X83901267"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(83)90126-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}