{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:47:15Z","timestamp":1761058035190},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":6713,"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,3]]},"DOI":"10.1016\/0195-6698(95)90050-0","type":"journal-article","created":{"date-parts":[[2004,8,5]],"date-time":"2004-08-05T04:27:27Z","timestamp":1091680047000},"page":"107-110","source":"Crossref","is-referenced-by-count":2,"title":["The complete list of maximal cliques of Quad(n, q), q odd"],"prefix":"10.1016","volume":"16","author":[{"given":"Andries","family":"Brouwer","sequence":"first","affiliation":[]},{"given":"Joe","family":"Hemmeter","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Woldar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0195-6698(95)90050-0_BIB1","article-title":"Algebraic Combinatorics I: Association Schemes","author":"Bannai","year":"1984","journal-title":"Benjamin\/Cummings Lecture Note Series 58"},{"key":"10.1016\/0195-6698(95)90050-0_BIB2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0195-6698(92)90038-2","article-title":"A new family of distance-regular graphs and the {0, 1, 2}-cliques in dual polar graphs","volume":"13","author":"Brouwer","year":"1992","journal-title":"Europ. J. Combin."},{"key":"10.1016\/0195-6698(95)90050-0_BIB3","series-title":"Distance-regular Graphs","author":"Brouwer","year":"1989"},{"key":"10.1016\/0195-6698(95)90050-0_BIB4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0195-6698(88)80071-4","article-title":"The large cliques in the graph of quadratic forms","volume":"9","author":"Hemmeter","year":"1988","journal-title":"Europ. J. Combin."},{"key":"10.1016\/0195-6698(95)90050-0_BIB5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0195-6698(13)80065-0","article-title":"On the maximal cliques of the quadratic forms graph in even characteristic","volume":"11","author":"Hemmeter","year":"1990","journal-title":"Europ. J. Combin."},{"key":"10.1016\/0195-6698(95)90050-0_BIB6","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0195-6698(13)80026-1","article-title":"Classification of the maximal cliques of size \u2a7eq + 4 in the quadratic forms graph in odd characteristic","volume":"11","author":"Hemmeter","year":"1990","journal-title":"Europ. J. Combin."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0195669895900500?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0195669895900500?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:33Z","timestamp":1549344873000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0195669895900500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["0195669895900500"],"URL":"https:\/\/doi.org\/10.1016\/0195-6698(95)90050-0","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}