{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:41:12Z","timestamp":1772372472673,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"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":9482,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1987,8]]},"DOI":"10.1016\/0095-8956(87)90027-x","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"14-24","source":"Crossref","is-referenced-by-count":37,"title":["Distance-regularised graphs are distance-regular or distance-biregular"],"prefix":"10.1016","volume":"43","author":[{"given":"Chris D","family":"Godsil","sequence":"first","affiliation":[]},{"given":"John","family":"Shawe-Taylor","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(87)90027-X_BIB1","author":"Biggs","year":"1974"},{"key":"10.1016\/0095-8956(87)90027-X_BIB2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0095-8956(81)90046-0","article-title":"Spectral conditions for the reconstructibility of a graph","volume":"30","author":"Godsil","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(87)90027-X_BIB3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0095-8956(85)90065-6","article-title":"Distance-biregular graphs with 2-valent Vertices and distance-regular line graphs","volume":"38","author":"Mohar","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(87)90027-X_BIB4","doi-asserted-by":"crossref","unstructured":"J. Shawe-Taylor, The automorphism groups of primitive distance-bitransitive graphs are almost simple, European J. Combin., in press.","DOI":"10.1016\/S0195-6698(87)80010-0"},{"key":"10.1016\/0095-8956(87)90027-X_BIB5","article-title":"Regularity and Transitivity in Graphs","author":"Shawe-Taylor","year":"1985"},{"key":"10.1016\/0095-8956(87)90027-X_BIB6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0097-3165(83)90036-5","article-title":"Generalized n-gons and Chebychev polynomials","volume":"34","author":"Stanton","year":"1983","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589568790027X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589568790027X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T15:55:00Z","timestamp":1548777300000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589568790027X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["009589568790027X"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(87)90027-x","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}