{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:53Z","timestamp":1740107153638,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T00:00:00Z","timestamp":1574121600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T00:00:00Z","timestamp":1574121600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61370187"],"award-info":[{"award-number":["61370187"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s00373-019-02121-3","type":"journal-article","created":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T16:03:42Z","timestamp":1574179422000},"page":"115-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Edge-Connectivity of Strongly 3-Walk-Regular Graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Rongquan","family":"Feng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9312-4453","authenticated-orcid":false,"given":"Wenqian","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,19]]},"reference":[{"key":"2121_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0095-8956(71)90041-4","volume":"10","author":"I Anderson","year":"1971","unstructured":"Anderson, I.: Perfect matchings of a graph. J. Combin. Theory 10, 183\u2013186 (1971)","journal-title":"J. Combin. Theory"},{"key":"2121_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1939-6","volume-title":"Spectra of Graphs","author":"AE Brouwer","year":"2012","unstructured":"Brouwer, A.E., Haemers, W.H.: Spectra of Graphs. Springer, New York (2012)"},{"key":"2121_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0195-6698(85)80030-5","volume":"6","author":"AE Brouwer","year":"1985","unstructured":"Brouwer, A.E., Mesner, D.M.: The connectivity of strongly regular graphs. Eur. J. Combin. 6, 215\u2013216 (1985)","journal-title":"Eur. J. Combin."},{"key":"2121_CR4","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.jcta.2012.01.001","volume":"119","author":"SM Cioab\u0103","year":"2012","unstructured":"Cioab\u0103, S.M., Kim, K., Koolen, J.H.: On a conjecture of Brouwer involving the connectivity of strongly regular graphs. J. Combin. Theory, Ser. A 119, 904\u2013922 (2012)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"2121_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2013.10.008","volume":"38","author":"SM Cioab\u0103","year":"2014","unstructured":"Cioab\u0103, S.M., Koolen, J.H., Li, W.: Disconnecting strongly regular graphs. Eur. J. Combin. 38, 1\u201311 (2014)","journal-title":"Eur. J. Combin."},{"key":"2121_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139086547","volume-title":"Eigenspace of Graphs","author":"D Cvetkovi\u0107","year":"1997","unstructured":"Cvetkovi\u0107, D., Rowlinson, P., Simi\u0107, S.: Eigenspace of Graphs. Cambridge University Press, Cambridge (1997)"},{"key":"2121_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0097-3165(88)90043-X","volume":"47","author":"AM Duval","year":"1988","unstructured":"Duval, A.M.: 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":"2121_CR8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0024-3795(94)00346-F","volume":"226\u2013228","author":"ER van Dam","year":"1995","unstructured":"van Dam, E.R.: Regular graphs with four eigenvalues. Linear Algebra Appl. 226\u2013228, 139\u2013162 (1995)","journal-title":"Linear Algebra Appl."},{"key":"2121_CR9","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.jcta.2013.01.006","volume":"120","author":"ER van Dam","year":"2013","unstructured":"van Dam, E.R., Omidi, G.R.: Strongly walk-regular graphs. J. Combin. Theory, Ser. A 120, 803\u2013810 (2013)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"2121_CR10","first-page":"1","volume":"120","author":"ER van Dam","year":"2015","unstructured":"van Dam, E.R., Omidi, G.R.: Directed strongly walk-regular graphs. J. Algebr. Combin. 120, 1\u201317 (2015)","journal-title":"J. Algebr. Combin."},{"key":"2121_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, New York (2001)"},{"key":"2121_CR12","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/0024-3795(95)00199-2","volume":"226","author":"WH Haemers","year":"1995","unstructured":"Haemers, W.H.: Interlacing eigenvalues and graphs. Linear Algebra Appl. 226, 593\u2013616 (1995)","journal-title":"Linear Algebra Appl."},{"key":"2121_CR13","unstructured":"Lov\u00e1sz, L., Plummer, M. D.: Matching Theory, Ann. Discrete Math (1986)"},{"key":"2121_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"2","author":"WT Tutte","year":"1947","unstructured":"Tutte, W.T.: The factorization of linear graphs. J. Lond. Math. Soc. 2, 107\u2013111 (1947)","journal-title":"J. Lond. Math. Soc."},{"key":"2121_CR15","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s00373-019-02031-4","volume":"35","author":"W Zhang","year":"2019","unstructured":"Zhang, W.: The cyclic edge-connectivity of strongly regular graphs. Graphs Combin. 35, 779\u2013785 (2019)","journal-title":"Graphs Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02121-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02121-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02121-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T04:59:06Z","timestamp":1605675546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02121-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,19]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["2121"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02121-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,11,19]]},"assertion":[{"value":"29 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}