{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T14:44:00Z","timestamp":1772117040568,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10623-024-01557-w","type":"journal-article","created":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T07:56:27Z","timestamp":1735458987000},"page":"1401-1424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Divisible design graphs from the symplectic graph"],"prefix":"10.1007","volume":"93","author":[{"given":"Bart","family":"De Bruyn","sequence":"first","affiliation":[]},{"given":"Sergey","family":"Goryainov","sequence":"additional","affiliation":[]},{"given":"Willem H.","family":"Haemers","sequence":"additional","affiliation":[]},{"given":"Leonid","family":"Shalaginov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,29]]},"reference":[{"key":"1557_CR1","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1016\/j.disc.2008.07.037","volume":"309","author":"AE Brouwer","year":"2009","unstructured":"Brouwer A.E., \u00d6sterg\u00e5rd P.R.J.: Classification of the $$(0,2)$$-graphs of valency $$8$$. Discrete Mathematics 309, 532\u2013547 (2009). https:\/\/doi.org\/10.1016\/j.disc.2008.07.037.","journal-title":"Discrete Mathematics"},{"key":"1557_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/9781009057226","volume-title":"Strongly regular graphs","author":"AE Brouwer","year":"2022","unstructured":"Brouwer A.E., Van Maldeghem H.: Strongly regular graphs. Cambridge University Press, Cambridge (2022)."},{"key":"1557_CR3","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. Designs, Codes and Cryptography 72, 165\u2013175 (2014). https:\/\/doi.org\/10.1007\/s10623-013-9861-0.","journal-title":"Designs, Codes and Cryptography"},{"key":"1557_CR4","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 and Combinatorics 38, 17 (2022). https:\/\/doi.org\/10.1007\/s00373-021-02440-4.","journal-title":"Graphs and Combinatorics"},{"key":"1557_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10623-012-9705-3","volume":"68","author":"B De Bruyn","year":"2013","unstructured":"De Bruyn B.: The pseudo-hyperplanes and homogeneous pseudo-embeddings of the generalized quadrangles of order $$(3, t)$$. Designs, Codes and Cryptography 68, 259\u2013284 (2013).","journal-title":"Designs, Codes and Cryptography"},{"key":"1557_CR6","doi-asserted-by":"crossref","unstructured":"De Bruyn B., Pavese F., Pradhan P., Sahoo B. K.: On blocking sets of the tangent lines to a nonsingular quadric in PG (3,q), $$q$$ prime, Electron. J. Combin. 31(4), 20 (2024). https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v31i4p80.","DOI":"10.37236\/10840"},{"key":"1557_CR7","unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory, Philips Research Reports. Supplements, (10):vi+97, (1973)."},{"key":"1557_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF02413785","volume":"114","author":"RH Dye","year":"1977","unstructured":"Dye R.H.: Partitions and their stabilizers for line complexes and quadrics. Annali di Matematica Pura ed Applicata 114, 173\u2013194 (1977).","journal-title":"Annali di Matematica Pura ed Applicata"},{"issue":"5","key":"1557_CR9","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1007\/s10623-023-01348-9","volume":"92","author":"AL Gavrilyuk","year":"2024","unstructured":"Gavrilyuk A.L., Kabanov V.V.: Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique. Des. Codes Cryptogr. 92(5), 1379\u20131391 (2024).","journal-title":"Des. Codes Cryptogr."},{"key":"1557_CR10","doi-asserted-by":"crossref","unstructured":"Godsil C.\u00a0D., Meagher K.: Erd\u00f6s-Ko-Rado theorems: algebraic approaches, Cambridge University Press (2015).","DOI":"10.1017\/CBO9781316414958"},{"key":"1557_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic graph theory","author":"C Godsil","year":"2001","unstructured":"Godsil C., Royle G.: Algebraic graph theory. Springer-Verlag, New York (2001)."},{"key":"1557_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.V., Shalaginov L.: Deza graphs with parameters $$(n, k, k-1, a)$$ and $$\\beta = 1$$. Journal of Combinatorial Designs 27, 188\u2013202 (2019). https:\/\/doi.org\/10.1002\/jcd.21644.","journal-title":"Journal of Combinatorial Designs"},{"key":"1557_CR13","unstructured":"Goryainov S., Panasenko D.: On eigenfunctions of the block graphs of geometric Steiner systems, arXiv:2310.10334, October (2023). https:\/\/arxiv.org\/abs\/2310.10334"},{"key":"1557_CR14","unstructured":"Goryainov S., Shalaginov L.: Cayley-Deza graphs on less than 60 vertices. Siberian Electronic Mathematical Reports 11, 268\u2013310 (2014).(in Russian). http:\/\/semr.math.nsc.ru\/v11\/p268-310.pdf"},{"key":"1557_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2022.102150","volume":"87","author":"S Goryainov","year":"2023","unstructured":"Goryainov S., Shalaginov L., Yip C.H.: On eigenfunctions and maximal cliques of generalised Paley graphs of square order. Finite Fields and Their Applications 87, 102150 (2023). https:\/\/doi.org\/10.1016\/j.ffa.2022.102150.","journal-title":"Finite Fields and Their Applications"},{"key":"1557_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2024.105887","volume":"206","author":"S Goryainov","year":"2024","unstructured":"Goryainov S., Yip C.H.: Extremal Peisert-type graphs without the strict-EKR property. Journal of Combinatorial Theory, Series A 206, 105887 (2024). https:\/\/doi.org\/10.1016\/j.jcta.2024.105887.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"1557_CR17","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. Journal of Combinatorial Theory, Series A 118, 978\u2013992 (2011). https:\/\/doi.org\/10.1016\/j.jcta.2010.10.003.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"1557_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF00130574","volume":"8","author":"WH Haemers","year":"1996","unstructured":"Haemers W.H., Tonchev V.D.: Spreads in strongly regular graphs. Designs, Codes and Cryptography 8, 145\u2013157 (1996).","journal-title":"Designs, Codes and Cryptography"},{"key":"1557_CR19","volume-title":"Finite projective spaces of three dimensions","author":"JWP Hirschfeld","year":"1985","unstructured":"Hirschfeld J.W.P.: Finite projective spaces of three dimensions. Oxford University Press, New York (1985)."},{"key":"1557_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-6790-7","volume-title":"General Galois geometries","author":"JWP Hirschfeld","year":"2016","unstructured":"Hirschfeld J.W.P., Thas J.A.: General Galois geometries. Springer, London (2016)."},{"issue":"11","key":"1557_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113054","volume":"345","author":"VV Kabanov","year":"2022","unstructured":"Kabanov V.V.: New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs. Discrete Mathematics 345(11), 113054 (2022). https:\/\/doi.org\/10.1016\/j.disc.2022.113054.","journal-title":"Discrete Mathematics"},{"key":"1557_CR22","doi-asserted-by":"publisher","unstructured":"Kabanov V. V.: A new construction of strongly regular graphs with parameters of the complement symplectic graph, The Electronic Journal of Combinatorics, 30(1) (2023) #P1.25. https:\/\/doi.org\/10.37236\/11343","DOI":"10.37236\/11343"},{"key":"1557_CR23","doi-asserted-by":"publisher","unstructured":"Kabanov V. V., Shalaginov L.: On divisible design Cayley graphs, The Art of Discrete and Applied Mathematics, 4(2) (2021) #P2.02. https:\/\/doi.org\/10.26493\/2590-9770.1340.364","DOI":"10.26493\/2590-9770.1340.364"},{"key":"1557_CR24","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.disc.2015.11.002","volume":"339","author":"DS Krotov","year":"2016","unstructured":"Krotov D.S., Mogilnykh IYu., Potapov V.N.: To the theory of $$q$$-ary Steiner and other-type trades. Discrete Mathematics 339, 1150\u20131157 (2016). https:\/\/doi.org\/10.1016\/j.disc.2015.11.002.","journal-title":"Discrete Mathematics"},{"key":"1557_CR25","unstructured":"Panasenko D.: Database of small proper divisible design graphs, http:\/\/alg.imm.uran.ru\/dezagraphs\/ddgtab.html"},{"key":"1557_CR26","unstructured":"Panasenko D.: The vertex connectivity of some classes of divisible design graphs. Siberian Electronic Mathematical Reports 19(2), 426\u2013438 (2022).http:\/\/semr.math.nsc.ru\/v19\/n2\/p426-438.pdf"},{"issue":"4","key":"1557_CR27","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. Journal of Combinatorial Designs 30(4), 205\u2013219 (2022). https:\/\/doi.org\/10.1002\/jcd.21818.","journal-title":"Journal of Combinatorial Designs"},{"key":"1557_CR28","doi-asserted-by":"publisher","unstructured":"Royle G., Holt D.: Vertex-transitive graphs on fewer than $$48$$ vertices, [Data set] (2020), In Journal of Symbolic Computation (Version 1.0.0, Vol. 101, pp. 51\u201360), Zenodo. https:\/\/doi.org\/10.5281\/zenodo.4010122","DOI":"10.5281\/zenodo.4010122"},{"key":"1557_CR29","unstructured":"Sage Mathematics Software (Version 10.2), The Sage Developers, 2023. (http:\/\/www.sagemath.org)."},{"issue":"2","key":"1557_CR30","doi-asserted-by":"publisher","first-page":"1742","DOI":"10.33048\/semi.2021.18.134","volume":"18","author":"L Shalaginov","year":"2021","unstructured":"Shalaginov L.: Divisible design graphs with parameters $$(4n, n+2, n-2, 2, 4, n)$$ and $$(4n, 3n--2, 3n--6, 2n--2, 4, n)$$. Siberian Electronic Mathematical Reports 18(2), 1742\u20131756 (2021). https:\/\/doi.org\/10.33048\/semi.2021.18.134.","journal-title":"Siberian Electronic Mathematical Reports"},{"key":"1557_CR31","doi-asserted-by":"publisher","unstructured":"Sotnikova E., Valyuzhenich A.: Minimum supports of eigenfunctions of graphs: a survey, The Art of Discrete and Applied Mathematics 4 (2021), no. 2, Paper No. 2.09, 34 pp. https:\/\/doi.org\/10.26493\/2590-9770.1404.61e","DOI":"10.26493\/2590-9770.1404.61e"},{"key":"1557_CR32","unstructured":"The GAP Group, GAP \u2013 Groups, Algorithms, and Programming, Version 4.12.1, 2022. (http:\/\/www.gap-system.org)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01557-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01557-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01557-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T17:46:56Z","timestamp":1746640016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01557-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,29]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1557"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01557-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,29]]},"assertion":[{"value":"7 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 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 that there is no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}