{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T23:26:52Z","timestamp":1771975612649,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T00:00:00Z","timestamp":1710979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T00:00:00Z","timestamp":1710979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004488","name":"Hrvatska Zaklada za Znanost","doi-asserted-by":"publisher","award":["5713"],"award-info":[{"award-number":["5713"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004488","name":"Hrvatska Zaklada za Znanost","doi-asserted-by":"publisher","award":["4571"],"award-info":[{"award-number":["4571"]}],"id":[{"id":"10.13039\/501100004488","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":[[2024,4]]},"DOI":"10.1007\/s00373-024-02763-y","type":"journal-article","created":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T10:01:58Z","timestamp":1711015318000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Self-Orthogonal Codes from Deza Graphs, Normally Regular Digraphs and Deza Digraphs"],"prefix":"10.1007","volume":"40","author":[{"given":"Dean","family":"Crnkovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6558-5167","authenticated-orcid":false,"given":"Andrea","family":"\u0160vob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,21]]},"reference":[{"key":"2763_CR1","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1007\/s10623-021-00870-y","volume":"89","author":"D Bartoli","year":"2021","unstructured":"Bartoli, D., Montanucci, M., Zini, G.: On certain self-orthogonal AG codes with applications to quantum error-correcting codes. Des. Codes Cryptogr. 89, 1221\u20131239 (2021)","journal-title":"Des. Codes Cryptogr."},{"key":"2763_CR2","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. Disc. Math. 311, 132\u2013144 (2011)","journal-title":"Disc. Math."},{"key":"2763_CR3","unstructured":"Crnkovi\u0107, D., Kharaghani, H., Suda, S., \u0160vob, A.: New constructions of Deza digraphs. Int. J. Group Theory. 13 (2024), 225\u2013240 https:\/\/doi.org\/10.22108\/IJGT.2023.136268.1823"},{"key":"2763_CR4","doi-asserted-by":"crossref","unstructured":"Crnkovi\u0107, D., Kharaghani, H.: Divisible design digraphs. In: Colbourn, C.J. (Ed) Algebraic design theory and hadamard matrices. Springer Proc. Math. Stat., Vol. 133, Springer, New York, pp. 43\u201360 (2015)","DOI":"10.1007\/978-3-319-17729-8_4"},{"key":"2763_CR5","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":"2763_CR6","doi-asserted-by":"crossref","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. Disc. Math. 15, 22\u201341 (2020)","journal-title":"Contrib. Disc. Math."},{"key":"2763_CR7","doi-asserted-by":"publisher","first-page":"17, 8","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 Combin. 38, 17, 8 (2022)","journal-title":"Graphs Combin."},{"key":"2763_CR8","doi-asserted-by":"publisher","first-page":"591","DOI":"10.3934\/amc.2020032","volume":"14","author":"D Crnkovi\u0107","year":"2020","unstructured":"Crnkovi\u0107, D., Egan, R., \u0160vob, A.: Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs. Adv. Math. Commun. 14, 591\u2013602 (2020)","journal-title":"Adv. Math. Commun."},{"key":"2763_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10801-021-01104-z","volume":"55","author":"D Crnkovi\u0107","year":"2022","unstructured":"Crnkovi\u0107, D., Rukavina, S., \u0160vob, A.: Self-orthogonal codes from equitable partitions of association schemes. J. Algebraic Combin. 55, 157\u2013171 (2022)","journal-title":"J. Algebraic Combin."},{"key":"2763_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0097-3165(88)90043-X","volume":"47","author":"A Duval","year":"1988","unstructured":"Duval, A.: A directed graph version of strongly regular graphs. J. Combin. Theory Ser. A 47, 71\u2013100 (1988)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2763_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1002\/(SICI)1520-6610(1999)7:6<395::AID-JCD1>3.0.CO;2-U","volume":"7","author":"M Erickson","year":"1999","unstructured":"Erickson, M., Fernando, S., Haemers, W.H., Hardy, D., Hemmeter, J.: Deza graphs: a generalization of strongly regular graphs. J. Combin. Des. 7, 395\u2013405 (1999)","journal-title":"J. Combin. Des."},{"key":"2763_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TIT.2020.3020986","volume":"67","author":"X Fang","year":"2021","unstructured":"Fang, X., Liu, M., Luo, J.: Jinquan New MDS Euclidean self-orthogonal codes. IEEE Trans. Inform. Theory 67, 130\u2013137 (2021)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2763_CR13","doi-asserted-by":"publisher","first-page":"2703","DOI":"10.1007\/s10623-021-00957-6","volume":"90","author":"Y Fu","year":"2022","unstructured":"Fu, Y., Liu, H.: Galois self-orthogonal constacyclic codes over finite fields. Des. Codes Cryptogr. 90, 2703\u20132733 (2022)","journal-title":"Des. Codes Cryptogr."},{"key":"2763_CR14","doi-asserted-by":"publisher","first-page":"6442","DOI":"10.1109\/TIT.2021.3076878","volume":"67","author":"C Gan","year":"2021","unstructured":"Gan, C., Li, C., Mesnager, S., Qian, H.: On hulls of some primitive BCH codes and self-orthogonal codes. IEEE Trans. Inform. Theory 67, 6442\u20136455 (2021)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2763_CR15","doi-asserted-by":"publisher","first-page":"2275","DOI":"10.1007\/s10623-020-00778-z","volume":"88","author":"Y Gao","year":"2020","unstructured":"Gao, Y., Yue, Q., Wu, Y.: LCD codes and self-orthogonal codes in generalized dihedral group algebras. Des. Codes Cryptogr. 88, 2275\u20132287 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"2763_CR16","unstructured":"Goryainov, S., Panasenko, D., Shalaginov, L.: Database of small strictly Deza graphs. http:\/\/alg.imm.uran.ru\/dezagraphs\/dezatab.html"},{"key":"2763_CR17","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ejc.2018.10.006","volume":"80","author":"S Goryainov","year":"2019","unstructured":"Goryainov, S., Panasenko, D.: On vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs. Eur. J. Combin. 80, 143\u2013150 (2019)","journal-title":"Eur. J. Combin."},{"key":"2763_CR18","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. Combin. Des. 27, 188\u2013202 (2019)","journal-title":"J. Combin. Des."},{"key":"2763_CR19","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de"},{"key":"2763_CR20","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":"2763_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0012-365X(02)00553-8","volume":"264","author":"M Harada","year":"2003","unstructured":"Harada, M., Tonchev, V.D.: Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms. Discrete Math. 264, 81\u201390 (2003)","journal-title":"Discrete Math."},{"key":"2763_CR22","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01788675","volume":"5","author":"N Ito","year":"1989","unstructured":"Ito, N.: On spectra of doubly regular asymmetric digraphs of RH-type. Graphs Combin. 5, 229\u2013234 (1989)","journal-title":"Graphs Combin."},{"key":"2763_CR23","unstructured":"J\u00f8rgensen, L.: On normally regular digraphs, Preprint R-94-2023, Institute for Electronic Systems, Aalborg University (1994), Revised version (1999)"},{"key":"2763_CR24","doi-asserted-by":"crossref","unstructured":"J\u00f8rgensen, L., Jones, G., Klin, M., Song, S.Y.: Normally regular digraphs, association schemes and related combinatorial structure, S\u00e9m. Lothar. Combin. 71 (2014)","DOI":"10.37236\/4798"},{"key":"2763_CR25","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.ejc.2018.07.011","volume":"80","author":"V Kabanov","year":"2019","unstructured":"Kabanov, V., Maslova, N.V., Shalaginov, L.V.: On strictly Deza graphs with parameters $$(n, k, k-1, a)$$. Eur. J. Combin. 80, 194\u2013202 (2019)","journal-title":"Eur. J. Combin."},{"key":"2763_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2021.101923","volume":"76","author":"B Kim","year":"2021","unstructured":"Kim, B., Lee, Y., Yoo, J.: An infinite family of Griesmer quasi-cyclic self-orthogonal codes. Finite Fields Appl. 76, 101923, 21 (2021)","journal-title":"Finite Fields Appl."},{"key":"2763_CR27","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00200-020-00484-2","volume":"34","author":"V Mikuli\u0107 Crnkovi\u0107","year":"2023","unstructured":"Mikuli\u0107 Crnkovi\u0107, V., Traunkar, I.: Self-orthogonal codes constructed from weakly self-orthogonal designs invariant under an action of $$M_{11}$$. Appl. Algebra Eng. Comm. Comput. 34, 139\u2013156 (2023)","journal-title":"Appl. Algebra Eng. Comm. Comput."},{"key":"2763_CR28","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1007\/s12190-022-01785-0","volume":"69","author":"M Shi","year":"2023","unstructured":"Shi, M., Liu, N., Kim, J.-L.: Classification of binary self-orthogonal codes of lengths from 16 to 20 and its application. J. Appl. Math. Comput. 69, 1173\u20131203 (2023)","journal-title":"J. Appl. Math. Comput."},{"key":"2763_CR29","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1016\/j.ejc.2005.04.001","volume":"27","author":"K Wang","year":"2006","unstructured":"Wang, K., Feng, Y.: Deza digraphs. Eur. J. Combin. 27, 995\u20131004 (2006)","journal-title":"Eur. J. Combin."},{"key":"2763_CR30","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ejc.2007.02.009","volume":"29","author":"K Wang","year":"2008","unstructured":"Wang, K., Li, F.: Deza digraphs II. Eur. J. Combin. 29, 369\u2013378 (2008)","journal-title":"Eur. J. Combin."},{"key":"2763_CR31","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0195-6698(03)00016-7","volume":"28","author":"G Zhang","year":"2003","unstructured":"Zhang, G., Wang, K.: A directed version of Deza graphs - Deza digraphs. Aust. J. Combin. 28, 239\u2013244 (2003)","journal-title":"Aust. J. Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02763-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02763-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02763-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T20:22:18Z","timestamp":1731615738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02763-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,21]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2763"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02763-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,21]]},"assertion":[{"value":"11 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"35"}}