{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:16:32Z","timestamp":1757618192914,"version":"3.44.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003787","name":"Natural Science Foundation of Hebei Province","doi-asserted-by":"publisher","award":["A2023205045"],"award-info":[{"award-number":["A2023205045"]}],"id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["87792731"],"award-info":[{"award-number":["87792731"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s00373-025-02941-6","type":"journal-article","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T15:20:26Z","timestamp":1749482426000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On a Family of Divisible Design Digraphs"],"prefix":"10.1007","volume":"41","author":[{"given":"M.","family":"Muzychuk","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5935-141X","authenticated-orcid":false,"given":"G.","family":"Ryabov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,9]]},"reference":[{"key":"2941_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0021-8693(90)90067-X","volume":"133","author":"KT Arasu","year":"1990","unstructured":"Arasu, K.T., Jungnickel, D., Pott, A.: Divisible difference sets with multiplier $$-1$$. J. Algebra 133, 35\u201362 (1990)","journal-title":"J. Algebra"},{"key":"2941_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139507660","volume-title":"Design Theory","author":"T Beth","year":"1999","unstructured":"Beth, T., Jungnickel, D., Lenz, H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999)","edition":"2"},{"issue":"6","key":"2941_CR3","doi-asserted-by":"publisher","first-page":"2397","DOI":"10.1007\/s00373-021-02364-z","volume":"37","author":"R Bildanov","year":"2021","unstructured":"Bildanov, R., Panshin, V., Ryabov, G.: On WL-rank and WL-dimension of some deza circulant graphs. Graphs Combin. 37(6), 2397\u20132421 (2021)","journal-title":"Graphs Combin."},{"key":"2941_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"A Brouwer","year":"1989","unstructured":"Brouwer, A., Cohen, A., Neumaier, A.: Distance-Regular Graphs. Springer, Heidelberg (1989)"},{"key":"2941_CR5","volume-title":"Coherent Configurations","author":"G Chen","year":"2019","unstructured":"Chen, G., Ponomarenko, I.: Coherent Configurations. Central China Normal University Press, Wuhan (2019)"},{"key":"2941_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10623-013-9861-0","volume":"72","author":"D Crnkovi\u0107","year":"2014","unstructured":"Crnkovi\u0107, D., Haemers, W.H.: Walk-regular divisible design graphs. Des. Codes Cryptogr. 72, 165\u2013175 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"2941_CR7","doi-asserted-by":"crossref","unstructured":"Crnkovi\u0107, D., Kharaghani, H.: Divisible design digraphs, in: Algebraic Design Theory and Hadamard Matrices, (C. J. Colbourn, Ed.), Springer Proc. Math. Stat., Springer, New York 133 43\u201360 (2015)","DOI":"10.1007\/978-3-319-17729-8_4"},{"issue":"4","key":"2941_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111784","volume":"343","author":"D Crnkovi\u0107","year":"2020","unstructured":"Crnkovi\u0107, D., Kharaghani, H., \u0160vob, A.: Divisible design cayley digraphs. Discrete Math. 343(4), 111784 (2020)","journal-title":"Discrete Math."},{"key":"2941_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00373-021-02440-4","volume":"38","author":"D Crnkovi\u0107","year":"2022","unstructured":"Crnkovi\u0107, D., \u0160vob, A.: New constructions of divisible design cayley graphs. Graphs Comb. 38, 17 (2022)","journal-title":"Graphs Comb."},{"issue":"2","key":"2941_CR10","first-page":"189","volume":"14","author":"S Evdokimov","year":"2003","unstructured":"Evdokimov, S., Ponomarenko, I.: Characterization of cyclotomic schemes and normal Schur rings over a cyclic group. St. Petersburg Math. J. 14(2), 189\u2013221 (2003)","journal-title":"St. Petersburg Math. J."},{"key":"2941_CR11","unstructured":"Fuhlbr\u00fcck, F., K\u00f6bler, J., Verbitsky, O.: Identiability of graphs with small color classes by the Weisfeiler-Leman algorithm, in: Proc. $$37$$th International Symposium on Theoretical Aspects of Computer Science, Dagst\u00fchl Publishing, Germany (2020), 43:1\u201343:18"},{"key":"2941_CR12","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1002\/jcd.21644","volume":"27","author":"S Goryainov","year":"2019","unstructured":"Goryainov, S., Haemers, W.H., Kabanov, V., Shalaginov, L.: Deza graphs with parameters $$(n, k, k-1, a)$$ and $$\\beta =1$$. J. Comb. Des. 27, 188\u2013202 (2019)","journal-title":"J. Comb. Des."},{"key":"2941_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/9781139028868","volume-title":"Descriptive Complexity, Canonisation, and Definable Graph Structure Theory","author":"M Gr\u00f6he","year":"2017","unstructured":"Gr\u00f6he, M.: Descriptive Complexity, Canonisation, and Definable Graph Structure Theory. Cambridge University Press, Cambridge (2017)"},{"key":"2941_CR14","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1016\/j.jcta.2010.10.003","volume":"118","author":"WH Haemers","year":"2011","unstructured":"Haemers, W.H., Kharaghani, H., Meulenberg, M.A.: Divisible design graphs. J. Combin. Theory, Ser. A 118, 978\u2013992 (2011)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"2941_CR15","unstructured":"Hanaki, A., Miyamoto, I.: Classification of association schemes with small number of vertices. http:\/\/math.shinshu-u.ac.jp\/*hanaki\/as\/ (2016)"},{"key":"2941_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-64981-3","volume-title":"Endliche Gruppen","author":"B Huppert","year":"1967","unstructured":"Huppert, B.: Endliche Gruppen, vol. 1. Springer, Berlin-Heidelberg-New York (1967)"},{"issue":"11","key":"2941_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113054","volume":"345","author":"V Kabanov","year":"2022","unstructured":"Kabanov, V.: New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs. Discrete Math. 345(11), 113054 (2022)","journal-title":"Discrete Math."},{"issue":"2","key":"2941_CR18","first-page":"1","volume":"4","author":"V Kabanov","year":"2021","unstructured":"Kabanov, V., Shalaginov, L.: On divisible design cayley graphs. Art Discrete Appl. Math. 4(2), 1\u20139 (2021)","journal-title":"Art Discrete Appl. Math."},{"key":"2941_CR19","first-page":"81","volume":"18","author":"L Kalu\u017enin","year":"1976","unstructured":"Kalu\u017enin, L., Klin, M.: Some numerical invariants of permutation groups (Russian) Latviisk. Mat. E\u017eegodnik 18, 81\u201399 (1976). (222)","journal-title":"Mat. E\u017eegodnik"},{"key":"2941_CR20","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields, 2nd edn. Cambridge University Press (1997)","edition":"2"},{"key":"2941_CR21","doi-asserted-by":"publisher","first-page":"2615","DOI":"10.1007\/s10623-024-01406-w","volume":"92","author":"M Muzychuk","year":"2024","unstructured":"Muzychuk, M., Ryabov, G.: Constructing linked systems of relative difference sets via schur rings. Des. Codes Cryptogr. 92, 2615\u20132637 (2024)","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"2941_CR22","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/jcd.21818","volume":"30","author":"D Panasenko","year":"2022","unstructured":"Panasenko, D., Shalaginov, L.: Classification of divisible design graphs with at most 39 vertices. J. Comb. Des. 30(4), 205\u2013219 (2022)","journal-title":"J. Comb. Des."},{"issue":"1","key":"2941_CR23","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10469-018-9478-5","volume":"57","author":"G Ryabov","year":"2018","unstructured":"Ryabov, G.: On separability of Schur rings over abelian $$p$$-groups. Algebra Log. 57(1), 49\u201368 (2018)","journal-title":"Algebra Log."},{"key":"2941_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF00182946","volume":"44","author":"R-H Schulz","year":"1992","unstructured":"Schulz, R.-H., Spera, A.G.: Divisible designs and groups. Geom. Dedicata. 44, 147\u2013157 (1992)","journal-title":"Geom. Dedicata."},{"issue":"20","key":"2941_CR25","first-page":"598","volume":"18","author":"I Schur","year":"1933","unstructured":"Schur, I.: Zur theorie der einfach transitiven permutationgruppen. S.-B. Preus Akad. Wiss. Phys.-Math. Kl. 18(20), 598\u2013623 (1933)","journal-title":"S.-B. Preus Akad. Wiss. Phys.-Math. Kl."},{"volume-title":"On Construction and Identification of Graphs","year":"1976","key":"2941_CR26","unstructured":"Weisfeiler, B. (ed.): On Construction and Identification of Graphs. Springer-Verlag, Berlin-New York (1976)"},{"issue":"9","key":"2941_CR27","first-page":"12","volume":"2","author":"B Weisfeiler","year":"1968","unstructured":"Weisfeiler, B., Leman, A.: Reduction of a graph to a canonical form and an algebra which appears in the process. NTI 2(9), 12\u201316 (1968)","journal-title":"NTI"},{"key":"2941_CR28","volume-title":"Finite permutation groups","author":"H Wielandt","year":"1964","unstructured":"Wielandt, H.: Finite permutation groups. Academic Press, New York - London (1964)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02941-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02941-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02941-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T18:38:32Z","timestamp":1757183912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02941-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,9]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2941"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02941-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,6,9]]},"assertion":[{"value":"11 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2025","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Affiliations of the authors has been updated","order":6,"name":"change_details","label":"Change Details","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"}}],"article-number":"75"}}