{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:35:24Z","timestamp":1772829324353,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"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":10516,"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":[[1984,10]]},"DOI":"10.1016\/0095-8956(84)90070-4","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"173-188","source":"Crossref","is-referenced-by-count":7,"title":["The graphs G(n, k) of the Johnson Schemes are unique for n \u2265 20"],"prefix":"10.1016","volume":"37","author":[{"given":"Aeryung","family":"Moon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(84)90070-4_BIB1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.2140\/pjm.1968.25.219","article-title":"On the tetrahedral graph","volume":"25","author":"Aigner","year":"1968","journal-title":"Pacific J. Math."},{"key":"10.1016\/0095-8956(84)90070-4_BIB2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0021-9800(69)80104-3","article-title":"A characterization problem in graph theory","volume":"6","author":"Aigner","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0095-8956(84)90070-4_BIB3","unstructured":"E. Bannai and T. Ito, \u201cAlgebraic Combinatorics I: Association Schemes,\u201d Benjamin-Cummings Lecture Note Series, to appear."},{"key":"10.1016\/0095-8956(84)90070-4_BIB4","author":"Biggs","year":"1974"},{"key":"10.1016\/0095-8956(84)90070-4_BIB5","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/S0021-9800(67)80104-2","article-title":"A characterization of Tetrahedral graphs","volume":"3","author":"Bose","year":"1967","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0095-8956(84)90070-4_BIB6","first-page":"604","article-title":"The Uniqueness and Non-Uniqueness of the Triangular Association Schemes","volume":"3","author":"Chang","year":"1959","journal-title":"Sci. Record, Math. New. Ser."},{"key":"10.1016\/0095-8956(84)90070-4_BIB7","article-title":"A Synopsis of Known Distance-Regular Graphs with Large Diameters","author":"Cohen","year":"1981","journal-title":"MC report, ZW 168"},{"key":"10.1016\/0095-8956(84)90070-4_BIB8","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1214\/aoms\/1177706724","article-title":"The uniqueness of the triangular association scheme","volume":"29","author":"Connor","year":"1958","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0095-8956(84)90070-4_BIB9","article-title":"An algebraic approach to the association schemes of coding theory","volume":"10","author":"Delsarte","year":"1973","journal-title":"Phillips Res. Rep. Suppl."},{"key":"10.1016\/0095-8956(84)90070-4_BIB10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0021-9800(69)80085-2","article-title":"A characterization of Tm graph","volume":"6","author":"Dowling","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0095-8956(84)90070-4_BIB11","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0097-3165(81)90007-8","article-title":"Characterization of H(n, q) by the parameters","volume":"31","author":"Egawa","year":"1981","journal-title":"J. Combin. Theory Ser. A."},{"key":"10.1016\/0095-8956(84)90070-4_BIB12","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1214\/aoms\/1177705914","article-title":"On the uniqueness of the triangular association scheme","volume":"31","author":"Hoffman","year":"1960","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0095-8956(84)90070-4_BIB13","author":"Lancaster","year":"1969"},{"key":"10.1016\/0095-8956(84)90070-4_BIB14","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0513044","article-title":"Orthogonal polynomials, duality, and association schemes","volume":"13","author":"Leonard","year":"1982","journal-title":"Siam. J. Math. Anal."},{"key":"10.1016\/0095-8956(84)90070-4_BIB15","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/0095-8956(77)90070-3","article-title":"On the uniqueness of the tetrahedral association schemes","volume":"22","author":"Liebler","year":"1977","journal-title":"J. Combin. Theory Ser. B."},{"key":"10.1016\/0095-8956(84)90070-4_BIB16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0012-365X(82)90057-7","article-title":"Characterization of the odd graphs Ok by parameters","volume":"42","author":"Moon","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(84)90070-4_BIB17","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0095-8956(82)90040-5","article-title":"Characterization of the graphs of the Johnson schemes G(3k, k) and G(3k + 1, k)","volume":"33","author":"Moon","year":"1982","journal-title":"J. Combin. Theory Ser. B."},{"key":"10.1016\/0095-8956(84)90070-4_BIB18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/0095-8956(82)90045-4","article-title":"On the uniqueness of the graphs G(n, k) of the Johnson schemes","volume":"33","author":"Moon","year":"1982","journal-title":"J. Combin. Theory Ser. B."},{"key":"10.1016\/0095-8956(84)90070-4_BIB19","article-title":"On the Uniqueness of the Tetrahedral Association Scheme","author":"Rolland","year":"1976"},{"key":"10.1016\/0095-8956(84)90070-4_BIB20","first-page":"264","article-title":"On a prblem of formal logic","volume":"30","author":"Ramsey","year":"1929"},{"key":"10.1016\/0095-8956(84)90070-4_BIB21","first-page":"188","article-title":"Strongly regular graphs of L2 type and of triangular type","volume":"70","author":"Seidel","year":"1967"},{"key":"10.1016\/0095-8956(84)90070-4_BIB22","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1214\/aoms\/1177706357","article-title":"On the Characterization of the Triangular Association Scheme","volume":"30","author":"Shrikhande","year":"1959","journal-title":"Ann. Math. Statist."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900704?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895684900704?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:52:37Z","timestamp":1548881557000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895684900704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["0095895684900704"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(84)90070-4","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}