{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:10:42Z","timestamp":1702599042911},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T00:00:00Z","timestamp":1697500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T00:00:00Z","timestamp":1697500800000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00373-023-02715-y","type":"journal-article","created":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T09:02:20Z","timestamp":1697533340000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Quasi-strongly Regular Graphs with Parameters $$(n,k,a;k-2,c_{2})$$ (I)"],"prefix":"10.1007","volume":"39","author":[{"given":"Jiayi","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gengsheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,17]]},"reference":[{"key":"2715_CR1","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)"},{"issue":"6","key":"2715_CR2","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1002\/(SICI)1520-6610(1999)7:6<395::AID-JCD1>3.0.CO;2-U","volume":"7","author":"M Erickson","year":"1999","unstructured":"Erickson, M., Fernando, S., Haemers, W.H., Hardy, D., Hemmeter, J.: Deza graph: a generalization of strongly regular graphs. J. Combin. Des. 7(6), 395\u2013405 (1999)","journal-title":"J. Combin. Des."},{"issue":"6","key":"2715_CR3","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1080\/03081080600867210","volume":"54","author":"F Goldberg","year":"2006","unstructured":"Goldberg, F.: On quasi-strongly regular graphs. Linear Multilinear Algebra 54(6), 437\u2013451 (2006)","journal-title":"Linear Multilinear Algebra"},{"key":"2715_CR4","first-page":"89","volume":"124","author":"WL Golightly","year":"1997","unstructured":"Golightly, W.L., Haynsworth, W.H., Sarvate, D.G.: A family of connected quasi-strongly regular graphs. Congr. Numer. 124, 89\u201395 (1997)","journal-title":"Congr. Numer."},{"key":"2715_CR5","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$$. J. Combin. Des. 27, 188\u2013202 (2019)","journal-title":"J. Combin. Des."},{"key":"2715_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s00373-021-02441-3","volume":"38","author":"Z Guo","year":"2022","unstructured":"Guo, Z., Jia, D., Zhang, G.: Some constructions of quasi-strongly regular digraphs. Graphs Combin. 38, 15 (2022)","journal-title":"Graphs Combin."},{"issue":"8","key":"2715_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.112922","volume":"345","author":"Z Guo","year":"2022","unstructured":"Guo, Z., Zhang, G.: On the second neighbourhoods of quasi-strongly regular graphs. Discrete Math. 345(8), 112922 (2022)","journal-title":"Discrete Math."},{"issue":"4","key":"2715_CR8","doi-asserted-by":"publisher","first-page":"493","DOI":"10.4153\/CMB-1967-046-4","volume":"10","author":"RK Guy","year":"1967","unstructured":"Guy, R.K., Harary, F.: On the M\u00f6bius ladders. Can. Math. Bull. 10(4), 493\u2013496 (1967)","journal-title":"Can. Math. Bull."},{"key":"2715_CR9","unstructured":"Hu, W.: Automorphisms of the graph $$L_{(K_{m,n})}$$. M.S. Thesis. Shanxi University (2011) (in Chinese)"},{"key":"2715_CR10","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s00373-018-1894-8","volume":"34","author":"D Jia","year":"2018","unstructured":"Jia, D., Yuan, L., Zhang, G.: On generalized strongly regular graphs. Graphs Combin. 34, 555\u2013570 (2018)","journal-title":"Graphs Combin."},{"key":"2715_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.ejc.2018.07.011","volume":"80","author":"VV Kabanov","year":"2019","unstructured":"Kabanov, V.V., Maslova, N.V., Shalaginov, L.: On strictly Deza graphs with parameters $$(n, k, k-1, a)$$. Eur. J. Combin. 80, 194\u2013202 (2019)","journal-title":"Eur. J. Combin."},{"key":"2715_CR12","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1002\/jcd.21722","volume":"28","author":"VV Kabanov","year":"2020","unstructured":"Kabanov, V.V., Shalaginov, L.: Deza graphs with parameters $$(v, k, k-2, a)$$. J. Combin. Des. 28, 658\u2013669 (2020)","journal-title":"J. Combin. Des."},{"key":"2715_CR13","unstructured":"Sriwongsa, S., Kaemawichanurat, P.: Quasi-strongly regular graphs of grade three with diameter two. MSC (2021)"},{"key":"2715_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112237","volume":"344","author":"J Xie","year":"2021","unstructured":"Xie, J., Jia, D., Zhang, G.: On quasi-strongly regular graphs with parameters $$(n, k, a; k-1, c_2)$$. Discrete Math. 344, 112237 (2021)","journal-title":"Discrete Math."},{"key":"2715_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113433","volume":"346","author":"J Xie","year":"2023","unstructured":"Xie, J., Zhang, G.: On quasi-strongly regular graphs with parameters $$(n, k, a; k-2, c_2)$$ for $$a<k-5$$. Discrete Math. 346, 113433 (2023)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02715-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02715-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02715-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T17:03:24Z","timestamp":1702573404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02715-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,17]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["2715"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02715-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,17]]},"assertion":[{"value":"20 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 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 declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"119"}}