{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T21:04:54Z","timestamp":1784667894537,"version":"3.55.0"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004488","name":"Croatian Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.amc.2026.130215","type":"journal-article","created":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T12:57:18Z","timestamp":1782478638000},"page":"130215","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Construction of directed strongly regular graphs via their orbit matrices and genetic algorithm"],"prefix":"10.1016","volume":"531","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-0001-6558-5167","authenticated-orcid":false,"given":"Andrea","family":"\u0160vob","sequence":"additional","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":"78","reference":[{"key":"10.1016\/j.amc.2026.130215_bib0001","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0097-3165(88)90043-X","article-title":"A directed graph version of strongly regular graphs","volume":"47","author":"Duval","year":"1988","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.amc.2026.130215_bib0002","doi-asserted-by":"crossref","first-page":"389","DOI":"10.2140\/pjm.1963.13.389","article-title":"Strongly regular graphs, partial geometries and partially balanced designs","volume":"13","author":"Bose","year":"1963","journal-title":"Pacific J. Math."},{"key":"10.1016\/j.amc.2026.130215_bib0003","series-title":"Strongly Regular Graphs","author":"Brouwer","year":"2022"},{"key":"10.1016\/j.amc.2026.130215_bib0004","unstructured":"A.E. Brouwer, S.A. Hobart, Parameters of directed strongly regular graphs, https:\/\/homepages.cwi.nl\/aeb\/math\/dsrg\/dsrg.html."},{"key":"10.1016\/j.amc.2026.130215_bib0005","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1016\/j.ejc.2012.01.011","article-title":"Directed strongly regular graphs from 1\/2-designs","volume":"33","author":"Brouwer","year":"2012","journal-title":"Eur. J. Combin."},{"key":"10.1016\/j.amc.2026.130215_bib0006","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114146","article-title":"A construction of directed strongly regular graphs with parameters (63,11,8,1,2)","volume":"347","author":"Brouwer","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130215_bib0007","doi-asserted-by":"crossref","first-page":"22","DOI":"10.31801\/cfsuasmas.1062880","article-title":"Constructing directed strongly regular graphs by using semidirect products and semidihedral groups","volume":"72","author":"Pi\u00e7i","year":"2023","journal-title":"Commun. Fac. Sci. Univ. Ank. Ser. A1. Math. Stat."},{"key":"10.1016\/j.amc.2026.130215_bib0008","unstructured":"The GAP Group, GAP \u2013 groups, algorithms, and programming, version 4.8.4; 2016, http:\/\/www.gap-system.org."},{"key":"10.1016\/j.amc.2026.130215_bib0009","series-title":"Handbook of Magma Functions","author":"Bosma","year":"1994"},{"key":"10.1016\/j.amc.2026.130215_bib0010","series-title":"Atlas of Finite Groups","author":"Conway","year":"1985"},{"key":"10.1016\/j.amc.2026.130215_bib0011","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0012-365X(00)00364-2","article-title":"Some new symmetric designs with parameters (64,28,12)","volume":"237","author":"Crnkovi\u0107","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130215_bib0012","series-title":"Combinatorics \u201990 (Gaeta, 1990)","first-page":"275","article-title":"Coset enumeration in groups and constructions of symmetric designs","volume":"vol. 52","author":"Janko","year":"1992"},{"key":"10.1016\/j.amc.2026.130215_bib0013","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0097-3165(85)90107-4","article-title":"Construction of a new symmetric block design for (78,22,6) with the help of tactical decompositions","volume":"40","author":"Janko","year":"1985","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.amc.2026.130215_bib0014","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.disc.2010.10.005","article-title":"Strongly regular graphs with non-trivial automorphisms","volume":"311","author":"Behbahani","year":"2011","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130215_bib0015","doi-asserted-by":"crossref","first-page":"22","DOI":"10.55016\/ojs\/cdm.v15i1.62323","article-title":"Construction of strongly regular graphs having an automorphism group of composite order","volume":"15","author":"Crnkovi\u0107","year":"2020","journal-title":"Contrib. Discrete Math."},{"key":"10.1016\/j.amc.2026.130215_bib0016","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10801-021-01012-2","article-title":"Strongly regular graphs with parameters (81,30,9,12) and a new partial geometry","volume":"53","author":"Crnkovi\u0107","year":"2021","journal-title":"J. Algebraic Combin."},{"key":"10.1016\/j.amc.2026.130215_bib0017","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-5060(08)70319-4","article-title":"Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial configurations","volume":"2","author":"Corneil","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.amc.2026.130215_bib0018","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1002\/jcd.21838","article-title":"Constructing block designs with a prescribed automorphism group using genetic algorithm","volume":"30","author":"Crnkovi\u0107","year":"2022","journal-title":"J. Comb. Des."},{"key":"10.1016\/j.amc.2026.130215_bib0019","series-title":"Proceedings of the ITI 2009 31st International Conference on Information Technology Interfaces","first-page":"647","article-title":"Modified genetic algorithm for BIBD construction","author":"Martinjak","year":"2009"},{"key":"10.1016\/j.amc.2026.130215_bib0020","first-page":"183","article-title":"Finding unitals in symmetric designs using a modified genetic algorithm","volume":"24","author":"Crnkovi\u0107","year":"2013","journal-title":"Math. Pannon."},{"key":"10.1016\/j.amc.2026.130215_bib0021","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/s00200-025-00689-3","article-title":"Using a genetic algorithm for construction of strongly regular graphs with a prescribed automorphism group","volume":"37","author":"Crnkovi\u0107","year":"2026","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"10.1016\/j.amc.2026.130215_bib0022","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.disc.2015.01.013","article-title":"New mixed Moore graphs and directed strongly regular graphs","volume":"338","author":"J\u00f8rgensen","year":"2015","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130215_bib0023","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.jspi.2012.05.006","article-title":"On some transitive combinatorial structures constructed from the unitary group U(3,3)","volume":"144","author":"Crnkovi\u0107","year":"2014","journal-title":"J. Statist. Plann. Inference"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326002675?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326002675?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T20:44:10Z","timestamp":1784666650000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300326002675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":23,"alternative-id":["S0096300326002675"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2026.130215","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Construction of directed strongly regular graphs via their orbit matrices and genetic algorithm","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2026.130215","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"130215"}}