{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T15:47:20Z","timestamp":1777650440798,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"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":6133,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1996,10]]},"DOI":"10.1016\/s0012-365x(96)83019-6","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:04:08Z","timestamp":1034287448000},"page":"271-283","source":"Crossref","is-referenced-by-count":27,"title":["A characterization of the components of the graphs D(k,q)"],"prefix":"10.1016","volume":"157","author":[{"given":"F.","family":"Lazebnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.A.","family":"Ustimenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.J.","family":"Woldar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)83019-6_BIB1","first-page":"73","article-title":"Graphs with large girth","volume":"25-C","author":"Biggs","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)83019-6_BIB2","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/S0012-365X(96)83019-6_BIB3","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1006\/jctb.1995.1033","article-title":"Graphs of prescribed girth and bi-degree","volume":"64","author":"F\u00fcredi","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)83019-6_BIB4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(94)00058-L","article-title":"Explicit construction of graphs with an arbitrary large girth and of large size","volume":"60","author":"Lazebnik","year":"1995","journal-title":"Appl. Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)83019-6_BIB5","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1006\/eujc.1993.1048","article-title":"New examples of graphs without small cycles and of large size","volume":"14","author":"Lazebnik","year":"1993","journal-title":"Europ. J. Combin."},{"key":"10.1016\/S0012-365X(96)83019-6_BIB6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1090\/S0273-0979-1995-00569-0","article-title":"A new series of dense graphs of large girth","volume":"32","author":"Lazebnik","year":"1995","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(96)83019-6_BIB7","article-title":"A new series of dense graphs of large girth","author":"Lazebnik","year":"1993","journal-title":"Rutcor Research Report RRR 99-93"},{"key":"10.1016\/S0012-365X(96)83019-6_BIB8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","article-title":"Ramanujan graphs","volume":"8","author":"Lubotzky","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(96)83019-6_BIB9_1","first-page":"39","article-title":"Explicit group \u2014 theoretical construction of combinatorial schemes and their application to the design of expanders and concentrators","author":"Margulis","year":"1988","journal-title":"J. Prob. Informat. Transm."},{"key":"10.1016\/S0012-365X(96)83019-6_BIB9_2","first-page":"51","article-title":"Explicit group \u2014 theoretical construction of combinatorial schemes and their application to the design of expanders and concentrators","volume":"24","author":"Margulis","year":"1988","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/S0012-365X(96)83019-6_BIB10","article-title":"GADAR and its application to extremal graph theory","author":"Schliep","year":"1994"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96830196?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96830196?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:22:50Z","timestamp":1555190570000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96830196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["S0012365X96830196"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)83019-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}