{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:21Z","timestamp":1740107121468,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T00:00:00Z","timestamp":1691798400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T00:00:00Z","timestamp":1691798400000},"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":["NSFC 11871439, 11971439, and U20A2068","NSFC 11971438 and U20A2068"],"award-info":[{"award-number":["NSFC 11871439, 11971439, and U20A2068","NSFC 11971438 and U20A2068"]}],"id":[{"id":"10.13039\/501100001809","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":[[2023,10]]},"DOI":"10.1007\/s00373-023-02693-1","type":"journal-article","created":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T02:01:47Z","timestamp":1691805707000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["2-Reconstructibility of Strongly Regular Graphs and 2-Partially Distance-Regular Graphs"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8818-1667","authenticated-orcid":false,"given":"Douglas B.","family":"West","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,12]]},"reference":[{"key":"2693_CR1","doi-asserted-by":"crossref","unstructured":"Brouwer, A.E., van Maldeghem, H.: Strongly Regular Graphs, Encyclopedia Math. Appl. 182 (Cambridge University Press 2022), xvii+462 pp","DOI":"10.1017\/9781009057226"},{"key":"2693_CR2","unstructured":"Biggs, N.L.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1993), page 159"},{"key":"2693_CR3","doi-asserted-by":"crossref","unstructured":"Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs, p. 434. Springer-Verlag, Berlin (1989)","DOI":"10.1007\/978-3-642-74341-2"},{"key":"2693_CR4","unstructured":"Chernyak, Zh.A.: Some additions to an article by B. Manvel: \"Some basic observations on Kelly\u2019s conjecture for graphs\u201d (Russian), Vests\u012b Akad. Navuk BSSR Ser. F$${\\bar{i}}$$z.-Mat. Navuk 126, 44\u201349 (1982)"},{"key":"2693_CR5","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1016\/j.jcta.2010.10.005","volume":"118","author":"C Dalf\u00f3","year":"2011","unstructured":"Dalf\u00f3, C., van Dam, E.R., Fiol, M.A., Garriga, E., Gorissen, B.L.: On almost distance-regular graphs. J. Combin. Theory Ser. A 118, 1094\u20131113 (2011)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2693_CR6","unstructured":"Huang, T., Huang, Y., Liu, S.-C., Weng, C.: Partially distance-regular graphs and partially walk-regular graphs (2007), http:\/\/jupiter.math.nctu.edu.tw\/~weng\/papers\/11_27.pdf"},{"key":"2693_CR7","unstructured":"Kelly, P.J.: On isometric transformations, PhD Thesis, University of Wisconsin\u2013Madison, (1942)"},{"key":"2693_CR8","doi-asserted-by":"publisher","first-page":"961","DOI":"10.2140\/pjm.1957.7.961","volume":"7","author":"PJ Kelly","year":"1957","unstructured":"Kelly, P.J.: A congruence theorem for trees. Pacific J. Math. 7, 961\u2013968 (1957)","journal-title":"Pacific J. Math."},{"key":"2693_CR9","doi-asserted-by":"crossref","unstructured":"Kostochka, A.V., Nahvi, M., West, D.B., Zirlin, D.: 3-regular graphs are 2-reconstructible. Eur. J. Combinatorics 91, 10 pages, 103216 (2021)","DOI":"10.1016\/j.ejc.2020.103216"},{"key":"2693_CR10","doi-asserted-by":"publisher","first-page":"3278","DOI":"10.1109\/TIT.2020.2983678","volume":"67","author":"AV Kostochka","year":"2021","unstructured":"Kostochka, A.V., West, D.B.: On reconstruction of graphs from the multiset of subgraphs obtained by deleting $$\\ell $$ vertices. IEEE Trans. Inf. Theory 67, 3278\u20133286 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2693_CR11","doi-asserted-by":"crossref","unstructured":"Manvel, B.: On reconstruction of graphs. In: The Many Facets of Graph Theory (Proc. Conf. Western Mich. Univ., Kalamazoo, Mich., 1968), pp. 207\u2013214. Springer, Berlin (1969)","DOI":"10.1007\/BFb0060119"},{"key":"2693_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(74)90064-8","volume":"8","author":"B Manvel","year":"1974","unstructured":"Manvel, B.: Some basic observations on Kelly\u2019s conjecture for graphs. Discrete Math. 8, 181\u2013185 (1974)","journal-title":"Discrete Math."},{"key":"2693_CR13","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/0012-365X(92)90689-D","volume":"108","author":"V N\u00fddl","year":"1992","unstructured":"N\u00fddl, V.: Finite undirected graphs which are not reconstructible from their large cardinality subgraphs. Discrete Math. 108, 373\u2013377 (1992)","journal-title":"Discrete Math."},{"key":"2693_CR14","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/jgt.22409","volume":"90","author":"H Spinoza","year":"2019","unstructured":"Spinoza, H., West, D.B.: Reconstruction from the deck of $$k$$-vertex induced subgraphs. J. Graph Theory 90, 497\u2013522 (2019)","journal-title":"J. Graph Theory"},{"key":"2693_CR15","unstructured":"Ulam, S.M.: A collection of mathematical problems, Interscience Tracts in Pure and Applied Mathematics, vol. 8. Interscience Publishers, Geneva (1960)"},{"key":"2693_CR16","doi-asserted-by":"crossref","unstructured":"van\u00a0Dam, E.R., Koolen, J.H., Tanaka, H.: Distance-regular graphs. Electr. J. Combinatorics, Dynamic Survey #22 (2016)","DOI":"10.37236\/4925"},{"key":"2693_CR17","doi-asserted-by":"crossref","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)","DOI":"10.1017\/CBO9780511987045"},{"key":"2693_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Liang, X., Koolen, J.H.: The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one. Discrete Math. 345, 112749 (2022), 12 pages","DOI":"10.1016\/j.disc.2021.112749"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02693-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02693-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02693-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T04:03:43Z","timestamp":1697083423000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02693-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,12]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["2693"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02693-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2023,8,12]]},"assertion":[{"value":"20 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 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 authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"94"}}