{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T07:57:12Z","timestamp":1782547032888,"version":"3.54.5"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T00:00:00Z","timestamp":1747872000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T00:00:00Z","timestamp":1747872000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s00200-025-00689-3","type":"journal-article","created":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T09:47:05Z","timestamp":1747907225000},"page":"803-818","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Using a genetic algorithm for construction of strongly regular graphs with a prescribed automorphism group"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3299-7859","authenticated-orcid":false,"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3620-2176","authenticated-orcid":false,"given":"Tin","family":"Zrinski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,22]]},"reference":[{"key":"689_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.disc.2010.10.005","volume":"311","author":"M Behbahani","year":"2011","unstructured":"Behbahani, M., Lam, C.: Strongly regular graphs with non-trivial automorphisms. Discrete Math. 311, 132\u2013144 (2011)","journal-title":"Discrete Math."},{"key":"689_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3336\/gm.45.1.01","volume":"45","author":"S Brai\u0107","year":"2010","unstructured":"Brai\u0107, S., Golemac, A., Mandi\u0107, J., Vu\u010di\u010di\u0107, T.: Graphs and symmetric designs corresponding to difference sets in groups of order 96. Glas. Mat. 45, 1\u201314 (2010)","journal-title":"Glas. Mat."},{"key":"689_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0012-365X(02)00546-0","volume":"264","author":"AE Brouwer","year":"2003","unstructured":"Brouwer, A.E., Koolen, J.H., Klin, M.H.: A root graph that is locally the line graph of the Petersen graph. Discrete Math. 264, 13\u201324 (2003)","journal-title":"Discrete Math."},{"key":"689_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-5060(08)70319-4","volume":"2","author":"DG Corneil","year":"1978","unstructured":"Corneil, D.G., Mathon, R.: Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial configurations. Ann. Discrete Math. 2, 1\u201332 (1978)","journal-title":"Ann. Discrete Math."},{"key":"689_CR5","first-page":"183","volume":"24","author":"D Crnkovi\u0107","year":"2013","unstructured":"Crnkovi\u0107, D., Dumi\u010di\u0107 Danilovi\u0107, D.: Finding unitals in symmetric designs using a modified genetic algorithm. Math. Pannon. 24, 183\u2013196 (2013)","journal-title":"Math. Pannon."},{"key":"689_CR6","doi-asserted-by":"publisher","first-page":"22","DOI":"10.55016\/ojs\/cdm.v15i1.62323","volume":"15","author":"D Crnkovi\u0107","year":"2020","unstructured":"Crnkovi\u0107, D., Maksimovi\u0107, M.: Construction of strongly regular graphs having an automorphism group of composite order. Contrib. Discrete Math. 15, 22\u201341 (2020)","journal-title":"Contrib. Discrete Math."},{"key":"689_CR7","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10801-021-01012-2","volume":"53","author":"D Crnkovi\u0107","year":"2021","unstructured":"Crnkovi\u0107, D., \u0160vob, A., Tonchev, V.D.: Strongly regular graphs with parameters (81,30,9,12) and a new partial geometry. J. Algebraic Combin. 53, 253\u2013261 (2021)","journal-title":"J. Algebraic Combin."},{"key":"689_CR8","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1002\/jcd.21838","volume":"30","author":"D Crnkovi\u0107","year":"2022","unstructured":"Crnkovi\u0107, D., Zrinski, T.: Constructing block designs with a prescribed automorphism group using genetic algorithm. J. Comb. Des. 30, 515\u2013526 (2022)","journal-title":"J. Comb. Des."},{"issue":"1","key":"689_CR9","first-page":"28","volume":"84","author":"F Ihringer","year":"2022","unstructured":"Ihringer, F.: Switching for small strongly regular graphs. Australas. J. Combin. 84(1), 28\u201348 (2022)","journal-title":"Australas. J. Combin."},{"key":"689_CR10","doi-asserted-by":"crossref","unstructured":"Martinjak, I., Pav\u010devi\u0107, M.O.: Modified genetic algorithm for BIBD construction. In: Luzar-Stiffler, V., Jarec, I., Bekic, Z. (eds.) Proceedings of the ITI 2009 31st International Conferences on Information Technology Interfaces, Cavtat, Croatia. pp. 647\u2013652 (2009)","DOI":"10.1109\/ITI.2009.5196164"},{"key":"689_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10801-006-0030-7","volume":"25","author":"M Muzychuk","year":"2007","unstructured":"Muzychuk, M.: A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs. J. Algebraic Combin. 25, 169\u2013187 (2007)","journal-title":"J. Algebraic Combin."},{"key":"689_CR12","unstructured":"The GAP Group: GAP \u2013 Groups, Algorithms, and Programming, Version 4.8.4 (2016). (http:\/\/www.gap-system.org)"},{"key":"689_CR13","unstructured":"Vu\u010di\u010di\u0107, T.: https:\/\/mapmf.pmfst.unist.hr\/~vucicic\/DifSets96\/. Accessed 07 December 2023"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00689-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-025-00689-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-025-00689-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T08:42:58Z","timestamp":1781167378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-025-00689-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,22]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["689"],"URL":"https:\/\/doi.org\/10.1007\/s00200-025-00689-3","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,22]]},"assertion":[{"value":"28 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}