{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:50:58Z","timestamp":1780386658457,"version":"3.54.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T00:00:00Z","timestamp":1682726400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T00:00:00Z","timestamp":1682726400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801353"],"award-info":[{"award-number":["11801353"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10623-023-01231-7","type":"journal-article","created":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T10:01:42Z","timestamp":1682762502000},"page":"2737-2754","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal and extremal graphical designs on regular graphs associated with classical parameters"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7164-9198","authenticated-orcid":false,"given":"Yan","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,29]]},"reference":[{"issue":"5","key":"1231_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00041-021-09852-z","volume":"27","author":"C Babecki","year":"2021","unstructured":"Babecki C.: Codes, cubes, and graphical designs. J. Fourier Anal. Appl. 27(5), 1\u201334 (2021).","journal-title":"J. Fourier Anal. Appl."},{"key":"1231_CR2","volume-title":"Algebraic Combinatorics I: Association Schemes","author":"E Bannai","year":"1984","unstructured":"Bannai E., Ito T.: Algebraic Combinatorics I: Association Schemes. Benjamin\/Cummings, Menlo Park, CA (1984)."},{"key":"1231_CR3","doi-asserted-by":"crossref","unstructured":"Bannai E., Bannai E., Ito T., Tanaka R.: Algebraic Combinatorics. De Gruyter Series in Discrete Mathematics and Applications 5, De Gruyter (2021).","DOI":"10.1515\/9783110630251"},{"key":"1231_CR4","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.jctb.2018.04.005","volume":"133","author":"AE Brouwer","year":"2018","unstructured":"Brouwer A.E., Cioab\u0103 S.M., Ihringer F., McGinnis M.: The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters. J. Combin. Theory Ser. B 133, 88\u2013121 (2018).","journal-title":"J. Combin. Theory Ser. B"},{"key":"1231_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"AE Brouwer","year":"1989","unstructured":"Brouwer A.E., Cohen A.M., Neumaier A.: Distance-Regular Graphs. Springer, Berlin (1989)."},{"issue":"2","key":"1231_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0097-3165(03)00006-2","volume":"102","author":"AE Brouwer","year":"2003","unstructured":"Brouwer A.E., Godsil C.D., Koolen J.H., Martin W.J.: Width and dual width of subsets in polynomial association schemes. J. Combin. Theory Ser. A 102(2), 255\u2013271 (2003).","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"1231_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01788084","volume":"2","author":"L Chihara","year":"1986","unstructured":"Chihara L., Stanton D.: Association schemes and quadratic transformations for orthogonal polynomials. Graphs Combin. 2(1), 101\u2013112 (1986).","journal-title":"Graphs Combin."},{"key":"1231_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/s00373-021-02445-z","volume":"38","author":"SM Ciobua","year":"2022","unstructured":"Ciobua S.M., Gupta H.: On the eigenvalues of Grassmann graphs, Bilinear forms graphs and Hermitian forms graphs. Graphs Combin. 38, 30 (2022).","journal-title":"Graphs Combin."},{"key":"1231_CR9","unstructured":"Delsarte P.: An Algebraic Approach to the Association Schemes of Coding Theory. PhD thesis, Universite Catholique de Louvain (1973)."},{"issue":"2","key":"1231_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/0097-3165(76)90017-0","volume":"20","author":"P Delsarte","year":"1976","unstructured":"Delsarte P.: Association schemes and $$t$$-designs in regular semilattices. J. Combin. Theory Ser. A 20(2), 230\u2013243 (1976).","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"1231_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF03187604","volume":"6","author":"P Delsarte","year":"1977","unstructured":"Delsarte P., Goethals J.M., Seidel J.J.: Spherical codes and designs. Geom. Dedicata 6(3), 363\u2013388 (1977).","journal-title":"Geom. Dedicata"},{"key":"1231_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"12","author":"P Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s P., Ko C., Rado R.: Intersection theorems for systems of finite sets. Q. J. Math. 12, 313\u2013320 (1961).","journal-title":"Q. J. Math."},{"key":"1231_CR13","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/j.laa.2020.07.012","volume":"604","author":"K Golubev","year":"2020","unstructured":"Golubev K.: Graphical designs and extremal combinatorics. Linear Algebra Appl. 604, 490\u2013506 (2020).","journal-title":"Linear Algebra Appl."},{"key":"1231_CR14","unstructured":"Kasami T.: Weight distributions of Bose-Chaudhuri-Hocquenghem codes. Coordinated Science Laboratory Report no. R-317 (1966)."},{"issue":"1","key":"1231_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.laa.2006.10.009","volume":"423","author":"CJ Luz","year":"2007","unstructured":"Luz C.J.: A characterization of Delsarte\u2019s linear programming bound as a ratio bound. Linear Algebra Appl. 423(1), 99\u2013108 (2007).","journal-title":"Linear Algebra Appl."},{"key":"1231_CR16","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. North Holland, Amsterdam (1977)."},{"key":"1231_CR17","unstructured":"Sobolev S.L.: Cubature formulas on the sphere which are invariant under transformations of finite rotation groups. In: Doklady Akademii Nauk, Vol. 146, pp. 310\u2013313. Russian Academy of Sciences (1962)."},{"issue":"2","key":"1231_CR18","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/jgt.22485","volume":"93","author":"S Steinerberger","year":"2020","unstructured":"Steinerberger S.: Generalized designs on graphs: sampling, spectra, symmetries. J. Graph Theory 93(2), 253\u2013267 (2020).","journal-title":"J. Graph Theory"},{"issue":"5","key":"1231_CR19","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/j.jcta.2005.08.006","volume":"113","author":"H Tanaka","year":"2006","unstructured":"Tanaka H.: Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs. J. Combin. Theory Ser. A 113(5), 903\u2013910 (2006).","journal-title":"J. Combin. Theory Ser. A"},{"key":"1231_CR20","doi-asserted-by":"crossref","unstructured":"Tanaka H.: Vertex subsets with minimal width and dual width in $$Q$$-polynomial distance-regular graphs. Electron. J. Combin. 18(1), Paper 167, 32 (2011).","DOI":"10.37236\/654"},{"issue":"6","key":"1231_CR21","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s00493-012-2798-5","volume":"32","author":"H Tanaka","year":"2012","unstructured":"Tanaka H.: The Erd\u00f6s-Ko-Rado theorem for twisted Grassmann graphs. Combinatorica 32(6), 735\u2013740 (2012).","journal-title":"Combinatorica"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01231-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01231-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01231-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T20:32:55Z","timestamp":1689885175000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01231-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,29]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1231"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01231-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,29]]},"assertion":[{"value":"6 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2023","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 author declares no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}