{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T05:20:42Z","timestamp":1721712042328},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1016\/j.jcta.2022.105684","type":"journal-article","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T11:54:04Z","timestamp":1662465244000},"page":"105684","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["An infinite class of Neumaier graphs and non-existence results"],"prefix":"10.1016","volume":"193","author":[{"given":"Aida","family":"Abiad","sequence":"first","affiliation":[]},{"given":"Wouter","family":"Castryck","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8399-9064","authenticated-orcid":false,"given":"Maarten","family":"De Boeck","sequence":"additional","affiliation":[]},{"given":"Jack H.","family":"Koolen","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6121-7698","authenticated-orcid":false,"given":"Sjanne","family":"Zeijlemaker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcta.2022.105684_br0010","article-title":"Neumaier graphs with few eigenvalues","author":"Abiad","year":"2020","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.jcta.2022.105684_br0020","article-title":"Gauss and Jacobi Sums","volume":"vol. 21","author":"Berndt","year":"1998"},{"key":"10.1016\/j.jcta.2022.105684_br0030","article-title":"Distance-Regular Graphs","volume":"vol. 18","author":"Brouwer","year":"1989"},{"key":"10.1016\/j.jcta.2022.105684_br0040","doi-asserted-by":"crossref","article-title":"Strongly Regular Graphs","author":"Brouwer","year":"2022","DOI":"10.1017\/9781009057226"},{"key":"10.1016\/j.jcta.2022.105684_br0050","series-title":"On regular induced subgraphs of edge-regular graphs","author":"Evans","year":"2020"},{"key":"10.1016\/j.jcta.2022.105684_br0060","author":"Evans"},{"issue":"2","key":"10.1016\/j.jcta.2022.105684_br0070","article-title":"The smallest strictly Neumaier graph and its generalisations","volume":"26","author":"Evans","year":"2019","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.jcta.2022.105684_br0080","first-page":"268","article-title":"Cayley\u2013Deza graphs with fewer than 60 vertices","volume":"11","author":"Goryainov","year":"2014","journal-title":"Sib. \u00c8lektron. Mat. Izv."},{"key":"10.1016\/j.jcta.2022.105684_br0090","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.ejc.2018.04.004","article-title":"Edge-regular graphs with regular cliques","volume":"71","author":"Greaves","year":"2018","journal-title":"Eur. J. Comb."},{"issue":"10","key":"10.1016\/j.jcta.2022.105684_br0100","doi-asserted-by":"crossref","first-page":"2818","DOI":"10.1016\/j.disc.2018.09.032","article-title":"Another construction of edge-regular graphs with regular cliques","volume":"342","author":"Greaves","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcta.2022.105684_br0110","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1137\/17M1129532","article-title":"Perfect codes in Cayley graphs","volume":"32","author":"Huang","year":"2018","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jcta.2022.105684_br0120","article-title":"A Classical Introduction to Modern Number Theory","volume":"vol. 84","author":"Ireland","year":"1990"},{"key":"10.1016\/j.jcta.2022.105684_br0130","article-title":"Class Field Theory","volume":"vol. 280","author":"Neukirch","year":"1986"},{"key":"10.1016\/j.jcta.2022.105684_br0140","series-title":"Finite Geometries and Designs","first-page":"244","article-title":"Regular cliques in graphs and special 1 1\/2-designs","volume":"vol. 49","author":"Neumaier","year":"1981"},{"key":"10.1016\/j.jcta.2022.105684_br0150","series-title":"An Introduction to the Theory of Numbers","author":"Niven","year":"1991"},{"key":"10.1016\/j.jcta.2022.105684_br0160","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.jalgebra.2014.08.028","article-title":"On cliques in edge-regular graphs","volume":"421","author":"Soicher","year":"2015","journal-title":"J. Algebra"},{"key":"10.1016\/j.jcta.2022.105684_br0170","author":"Sutherland"},{"key":"10.1016\/j.jcta.2022.105684_br0180","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2020.103228","article-title":"On subgroup perfect codes in Cayley graphs","volume":"91","author":"Zhang","year":"2021","journal-title":"Eur. J. Comb."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316522000929?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316522000929?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T20:33:04Z","timestamp":1672777984000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316522000929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":18,"alternative-id":["S0097316522000929"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.jcta.2022.105684","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An infinite class of Neumaier graphs and non-existence results","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series A","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcta.2022.105684","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"105684"}}
