{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T12:07:32Z","timestamp":1748866052229},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6468,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1016\/0195-6698(95)90040-3","type":"journal-article","created":{"date-parts":[[2004,8,5]],"date-time":"2004-08-05T04:27:27Z","timestamp":1091680047000},"page":"589-602","source":"Crossref","is-referenced-by-count":5,"title":["Distance-regular subgraphs in a distance-regular graph, I"],"prefix":"10.1016","volume":"16","author":[{"given":"Akira","family":"Hiraki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0195-6698(95)90040-3_BIB1","series-title":"Algebraic Combinatorics I","author":"Bannai","year":"1984"},{"key":"10.1016\/0195-6698(95)90040-3_BIB2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0095-8956(88)90084-6","article-title":"A remark on the intersection arrays of distance-regular graphs","volume":"44","author":"Boshier","year":"1988","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/0195-6698(95)90040-3_BIB3","series-title":"Distance-regular Graphs","author":"Brouwer","year":"1989"},{"key":"10.1016\/0195-6698(95)90040-3_BIB4","unstructured":"A. Hiraki, A constant bound on the number of columns (1, k \u2212 2, 1) in the intersection array of a distance-regular graphs, Graphs Combin., to appear."},{"key":"10.1016\/0195-6698(95)90040-3_BIB5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.2206\/kyushujm.49.197","article-title":"Circuit chasing technique for a distance-regular graph with c2r+1 = 1","volume":"49","author":"Hiraki","year":"1995","journal-title":"Kyushu J. Math."},{"key":"10.1016\/0195-6698(95)90040-3_BIB6","doi-asserted-by":"crossref","unstructured":"A. Hiraki, Distance-regular subgraphs in a distance-regular graph, II, Europ. J. Combin., to appear.","DOI":"10.1016\/0195-6698(95)90041-1"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0195669895900403?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0195669895900403?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T05:34:23Z","timestamp":1549344863000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0195669895900403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["0195669895900403"],"URL":"https:\/\/doi.org\/10.1016\/0195-6698(95)90040-3","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}