{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T17:24:35Z","timestamp":1776187475343,"version":"3.50.1"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T00:00:00Z","timestamp":1774828800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["P1-0294"],"award-info":[{"award-number":["P1-0294"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["J1-4351"],"award-info":[{"award-number":["J1-4351"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.jsc.2026.102580","type":"journal-article","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T15:56:22Z","timestamp":1774972582000},"page":"102580","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A census of Cayley graphs"],"prefix":"10.1016","volume":"137","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2837-582X","authenticated-orcid":false,"given":"Rhys J.","family":"Evans","sequence":"first","affiliation":[]},{"given":"Primo\u017e","family":"Poto\u010dnik","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jsc.2026.102580_br0010","author":"Besche"},{"key":"10.1016\/j.jsc.2026.102580_br0020","first-page":"623","article-title":"A millennium project: constructing small groups","volume":"12","author":"Besche","year":"2002","journal-title":"Int. J. Appl. Cryptogr."},{"key":"10.1016\/j.jsc.2026.102580_br0030","author":"Besche"},{"key":"10.1016\/j.jsc.2026.102580_br0040","doi-asserted-by":"crossref","DOI":"10.1006\/jsco.1996.0125","article-title":"The Magma algebra system. I. The user language","volume":"24","author":"Bosma","year":"1997","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102580_br0050","series-title":"The Foster Census","author":"Bouwer","year":"1988"},{"key":"10.1016\/j.jsc.2026.102580_br0060","doi-asserted-by":"crossref","first-page":"2408","DOI":"10.1080\/00927872.2021.2006680","article-title":"On the number of groups of order 1024","volume":"50","author":"Burrell","year":"2022","journal-title":"Commun. Algebra"},{"key":"10.1016\/j.jsc.2026.102580_br0070","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1090\/S0002-9939-1964-0159321-0","article-title":"On a theorem of sabidussi","author":"Chao","year":"1964","journal-title":"Proc. Am. Math. Soc."},{"key":"10.1016\/j.jsc.2026.102580_br0080","author":"Conder"},{"key":"10.1016\/j.jsc.2026.102580_br0090","first-page":"41","article-title":"Trivalent symmetric graphs on up to 768 vertices","volume":"40","author":"Conder","year":"2002","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"10.1016\/j.jsc.2026.102580_br0100","author":"Conder"},{"key":"10.1016\/j.jsc.2026.102580_br0110","series-title":"Zero\u2013Symmetric Graphs","author":"Coxeter","year":"1981"},{"key":"10.1016\/j.jsc.2026.102580_br0120","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1017\/S1446788700001312","article-title":"Finite groups that need more generators than any proper quotient","volume":"64","author":"Dalla Volta","year":"1998","journal-title":"J. Aust. Math. Soc. A"},{"key":"10.1016\/j.jsc.2026.102580_br0130","series-title":"Constructing Groups of \u2018Small\u2019 Order: Recent Results and Open Problems","first-page":"199","author":"Eick","year":"2017"},{"key":"10.1016\/j.jsc.2026.102580_br0140","article-title":"OpenAIRE","author":"European Organization For Nuclear Research","year":"2013","journal-title":"Zenodo"},{"key":"10.1016\/j.jsc.2026.102580_br0290","author":"Evans"},{"key":"10.1016\/j.jsc.2026.102580_br0150","article-title":"Dynamic cage survey","volume":"1","author":"Exoo","year":"2011","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.jsc.2026.102580_br0160","first-page":"131","article-title":"Constructive enumeration of combinatorial objects","author":"Farad\u017eev","year":"1978","journal-title":"Cent. Natl. Rech. Sci."},{"key":"10.1016\/j.jsc.2026.102580_br0170","series-title":"An algorithm to find normal subgroups of a finitely presented group, up to a given finite index","author":"Firth","year":"2005"},{"key":"10.1016\/j.jsc.2026.102580_br0180","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/T-AIEE.1932.5056068","article-title":"Geometrical circuits of electrical networks","volume":"51","author":"Foster","year":"1932","journal-title":"Trans. Am. Inst. Electr. Eng."},{"key":"10.1016\/j.jsc.2026.102580_br0190","author":"Gamble"},{"key":"10.1016\/j.jsc.2026.102580_br0200","first-page":"221","article-title":"Grrs for nonsolvable groups, algebraic methods in graph theory","author":"Godsil","year":"1981"},{"key":"10.1016\/j.jsc.2026.102580_br0210","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.jsc.2019.06.006","article-title":"A census of small transitive groups and vertex-transitive graphs","volume":"101","author":"Holt","year":"2020","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102580_br0220","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/j.jalgebra.2021.06.018","article-title":"The transitive groups of degree 48 and some applications","volume":"607","author":"Holt","year":"2022","journal-title":"J. Algebra"},{"key":"10.1016\/j.jsc.2026.102580_br0230","author":"Jefferson"},{"key":"10.1016\/j.jsc.2026.102580_br0240","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","article-title":"Practical graph isomorphism, II","volume":"60","author":"McKay","year":"2014","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102580_br0250","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1006\/jagm.1997.0898","article-title":"Isomorph-free exhaustive generation","volume":"26","author":"McKay","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/j.jsc.2026.102580_br0260","doi-asserted-by":"crossref","first-page":"53","DOI":"10.13069\/jacodesmath.867644","article-title":"Two families of graphs that are Cayley on nonisomorphic groups","volume":"8","author":"Morris","year":"2021","journal-title":"J. Algebr. Comb. Discrete Struct. Appl."},{"key":"10.1016\/j.jsc.2026.102580_br0270","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0021-9800(68)80086-9","article-title":"On the non-existence of graphs with transitive generalized dicyclic groups","volume":"4","author":"Nowitz","year":"1968","journal-title":"J. Comb. Theory"},{"key":"10.1016\/j.jsc.2026.102580_br0280","author":"Poto\u010dnik"},{"key":"10.1016\/j.jsc.2026.102580_br0300","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.jsc.2012.09.002","article-title":"Cubic vertex-transitive graphs on up to 1280 vertices","volume":"50","author":"Poto\u010dnik","year":"2013","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.jsc.2026.102580_br0310","series-title":"Symmetries in Graphs, Maps, and Polytopes","first-page":"273","article-title":"Groups of order at most 6,000 generated by two elements, one of which is an involution, and related structures","author":"Poto\u010dnik","year":"2016"},{"key":"10.1016\/j.jsc.2026.102580_br0320","series-title":"Algorithmic Aspects of Combinatorics","first-page":"107","article-title":"Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations*","volume":"vol. 2","author":"Read","year":"1978"},{"key":"10.1016\/j.jsc.2026.102580_br0340","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/BF01304186","article-title":"Vertex-transitive graphs","volume":"68","author":"Sabidussi","year":"1964","journal-title":"Monatshefte Math."},{"key":"10.1016\/j.jsc.2026.102580_br0350","author":"Soicher"},{"key":"10.1016\/j.jsc.2026.102580_br0370","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1017\/S0305004100023720","article-title":"A family of cubical graphs","volume":"43","author":"Tutte","year":"1947","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"10.1016\/j.jsc.2026.102580_br0380","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(71)90019-0","article-title":"On the action of non-abelian groups on graphs","volume":"11","author":"Watkins","year":"1971","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jsc.2026.102580_br0390","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1112\/plms.12563","article-title":"Asymptotic enumeration of graphical regular representations","volume":"127","author":"Xia","year":"2023","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717126000283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717126000283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T16:31:56Z","timestamp":1776184316000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717126000283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":37,"alternative-id":["S0747717126000283"],"URL":"https:\/\/doi.org\/10.1016\/j.jsc.2026.102580","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A census of Cayley graphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Symbolic Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jsc.2026.102580","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"102580"}}