{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T14:42:49Z","timestamp":1768747369812,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T00:00:00Z","timestamp":1617667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T00:00:00Z","timestamp":1617667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Research Foundation Flanders FWO"},{"name":"Reserach Foundation Flanders FWO","award":["1285921N"],"award-info":[{"award-number":["1285921N"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071454"],"award-info":[{"award-number":["12071454"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Anhui Initiative of Quantum Information Technologies","award":["No. AHY 150000"],"award-info":[{"award-number":["No. AHY 150000"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this paper we give some sufficient and necessary conditions for a Neumaier graph to be strongly regular. Further we show that there does not exist Neumaier graphs with exactly four distinct eigenvalues. We also determine the Neumaier graphs with smallest eigenvalue <jats:inline-formula><jats:alternatives><jats:tex-math>$$-2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s10623-021-00856-w","type":"journal-article","created":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T11:02:30Z","timestamp":1617706950000},"page":"2003-2019","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Neumaier graphs with few eigenvalues"],"prefix":"10.1007","volume":"90","author":[{"given":"Aida","family":"Abiad","sequence":"first","affiliation":[]},{"given":"Bart","family":"De\u00a0Bruyn","sequence":"additional","affiliation":[]},{"given":"Jozefien","family":"D\u2019haeseleer","sequence":"additional","affiliation":[]},{"given":"Jack H.","family":"Koolen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,6]]},"reference":[{"key":"856_CR1","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-Verlag, Berlin (1989)."},{"issue":"9","key":"856_CR2","doi-asserted-by":"publisher","first-page":"2692","DOI":"10.1016\/j.laa.2013.07.028","volume":"439","author":"M C\u00e1mara","year":"2013","unstructured":"C\u00e1mara M., van Dam E.R., Koolen J.H., Park Y.: Geometric aspects of 2-walk-regular graphs. Linear Algebra and its Applications 439(9), 2692\u20132710 (2013).","journal-title":"Linear Algebra and its Applications"},{"key":"856_CR3","volume-title":"Spectra of graphs","author":"DM Cvetkovi\u0107","year":"1995","unstructured":"Cvetkovi\u0107 D.M., Doob M., Sachs H.: Spectra of graphs. Theory and applications. Third edition. Johann Ambrosius Barth Verlag, Heidelberg (1995)."},{"key":"856_CR4","doi-asserted-by":"crossref","unstructured":"Cvetkovi\u0107, D., Rowlinson, P., Simi\u0107, S.: An introduction to the theory of graph spectra. London Mathematical Society Student Texts 75. Cambridge University Press, Cambridge, (2010).","DOI":"10.1017\/CBO9780511801518"},{"issue":"1","key":"856_CR5","doi-asserted-by":"publisher","first-page":"R47","DOI":"10.37236\/136","volume":"16","author":"C Dalf\u00f3","year":"2009","unstructured":"Dalf\u00f3 C., Fiol M.A., Garriga E.: On $$k$$-walk-regular graphs. Electron. J. Combin. 16(1), R47 (2009).","journal-title":"Electron. J. Combin."},{"issue":"5","key":"856_CR6","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00373-010-0924-y","volume":"26","author":"B De Bruyn","year":"2010","unstructured":"De Bruyn B., Suzuki H.: Intriguing sets of vertices of regular graphs. Graphs Combin. 26(5), 629\u2013646 (2010).","journal-title":"Graphs Combin."},{"key":"856_CR7","unstructured":"Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10, (1973)"},{"issue":"2","key":"856_CR8","doi-asserted-by":"publisher","first-page":"2.29","DOI":"10.37236\/8189","volume":"26","author":"RJ Evans","year":"2019","unstructured":"Evans R.J., Goryainov S., Panasenko D.: The smallest strictly Neumaier graph and its generalisations. Electron. J. Combin. 26(2), 2.29 (2019).","journal-title":"Electron. J. Combin."},{"key":"856_CR9","unstructured":"Goryainov, S.: private communication."},{"key":"856_CR10","first-page":"268","volume":"11","author":"S Goryainov","year":"2014","unstructured":"Goryainov S., Shalaginov L.: Cayley-Deza graphs with fewer than 60 vertices. Sib. Electron. Math. Rep. 11, 268\u2013310 (2014). (in Russian).","journal-title":"Sib. Electron. Math. Rep."},{"key":"856_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.ejc.2018.04.004","volume":"71","author":"GRW Greaves","year":"2018","unstructured":"Greaves G.R.W., Koolen J.H.: Edge-regular graphs with regular cliques. European J. Combin. 71, 194\u2013201 (2018).","journal-title":"European J. Combin."},{"issue":"10","key":"856_CR12","doi-asserted-by":"publisher","first-page":"2818","DOI":"10.1016\/j.disc.2018.09.032","volume":"342","author":"GRW Greaves","year":"2019","unstructured":"Greaves G.R.W., Koolen J.H.: Another construction of edge-regular graphs with regular cliques. Discrete Math. 342(10), 2818\u20132820 (2019).","journal-title":"Discrete Math."},{"key":"856_CR13","doi-asserted-by":"crossref","unstructured":"Neumaier, A.: Regular cliques in graphs and special $$\\frac{1}{2}$$-designs. In \u201cFinite geometries and designs, Proc. 2nd Isle of Thorns Conf. 1980, volume 49 of London Math. Soc. Lecture Note Ser., pages 244\u2013259. Cambridge University Press, (1981)","DOI":"10.1017\/CBO9781107325579.027"},{"key":"856_CR14","doi-asserted-by":"crossref","unstructured":"van Dam, E.R.: Regular graphs with four eigenvalues. Linear Algebra Appl. 226\u2013228, 139\u2013162 (1995)","DOI":"10.1016\/0024-3795(94)00346-F"},{"key":"856_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1008626416743","volume":"6","author":"ER van Dam","year":"1997","unstructured":"van Dam E.R., Haemers W.H.: A Characterization of Distance-Regular Graphs with Diameter Three. Journal of Algebraic Combinatorics 6, 299\u2013303 (1997).","journal-title":"Journal of Algebraic Combinatorics"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00856-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00856-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00856-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T15:15:09Z","timestamp":1661613309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00856-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,6]]},"references-count":15,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["856"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00856-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,6]]},"assertion":[{"value":"11 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}