{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:51:19Z","timestamp":1758477079798},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0020-0190(98)00051-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"149-153","source":"Crossref","is-referenced-by-count":2,"title":["A note on the \u00c1d\u00e1m conjecture for double loops"],"prefix":"10.1016","volume":"66","author":[{"given":"B.","family":"Litow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Mans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00051-9_BIB1","first-page":"393","article-title":"Research problem 2-10","volume":"3","author":"\u00c1d\u00e1m","year":"1967","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0020-0190(98)00051-9_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0012-365X(79)90011-6","article-title":"Isomorphism of circulant graphs and digraphs","volume":"25","author":"Alspach","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(98)00051-9_BIB3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","article-title":"Distributed loop computer networks: a survey","volume":"24","author":"Bermond","year":"1995","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0020-0190(98)00051-9_BIB4","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0095-8956(89)90040-3","article-title":"Hamiltonian decomposition of cayley graphs of degree 4","volume":"46","author":"Bermond","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0020-0190(98)00051-9_BIB5","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","article-title":"Circulants and their connectivities","volume":"8","author":"Boesch","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(98)00051-9_BIB6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0021-9800(70)80068-0","article-title":"Graphs with circulant adjacency matrices","volume":"9","author":"Elspas","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0020-0190(98)00051-9_BIB7","series-title":"An Introduction to the Theory of Numbers","author":"Hardy","year":"1979"},{"issue":"1","key":"10.1016\/S0020-0190(98)00051-9_BIB8","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1006\/jpdc.1997.1389","article-title":"Optimal distributed algorithms in unlabeled tori and chordal rings","volume":"46","author":"Mans","year":"1997","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"10.1016\/S0020-0190(98)00051-9_BIB9","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0097-3165(95)90031-4","article-title":"\u00c1d\u00e1m's conjecture is true in the square free case","volume":"72","author":"Muzychuk","year":"1995","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0020-0190(98)00051-9_BIB10_1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0020-0190(95)00121-R","article-title":"A note on isomorphic chordal rings","volume":"55","author":"Nayak","year":"1995","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0020-0190(98)00051-9_BIB10_2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(95)00207-3","article-title":"Erratum: A note on isomorphic chordal rings","volume":"57","author":"Nayak","year":"1996","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000519?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000519?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:53:58Z","timestamp":1555959238000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0020019098000519"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00051-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}