{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T15:02:44Z","timestamp":1648825364122},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":8843,"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":[[1989,5]]},"DOI":"10.1016\/0012-365x(89)90075-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"31-40","source":"Crossref","is-referenced-by-count":3,"title":["Extensions of networks with given diameter"],"prefix":"10.1016","volume":"75","author":[{"given":"J.-C.","family":"Bermond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Berrada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Bond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(89)90075-7_BIB1","unstructured":"D.I. Ameter and Max D. Gree, Graphs and Interconnection Networks, forthcoming book."},{"key":"10.1016\/0012-365X(89)90075-7_BIB2","series-title":"Surveys in Combinatorics","first-page":"1","article-title":"Graphs and interconnection networks: Diameter and vulnerability","volume":"82","author":"Bermond","year":"1983"},{"key":"10.1016\/0012-365X(89)90075-7_BIB3","unstructured":"J.-C. Bermond, J. Bond, S. Rudich, M. Santha and W.F. de la Vega, The radius of graphs on alphabets, submitted."},{"key":"10.1016\/0012-365X(89)90075-7_BIB4","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0743-7315(86)90008-0","article-title":"Strategies for interconnection networks: some methods from graph theory","volume":"3","author":"Bermond","year":"1986","journal-title":"J. Parallel and Distributed Computing"},{"key":"10.1016\/0012-365X(89)90075-7_BIB5","series-title":"Th\u00e9se","article-title":"Extension de r\u00e9seaux d'interconnexion","author":"Berrada","year":"1986"},{"key":"10.1016\/0012-365X(89)90075-7_BIB6","series-title":"Th\u00e9se d'Etat","article-title":"Grands r\u00e9seaux d'interconnexion","author":"Bond","year":"1987"},{"key":"10.1016\/0012-365X(89)90075-7_BIB7","unstructured":"J. Bond and J.-C. Konig, Extension de r\u00e9seaux de degr\u00e9 maximum donn\u00e9e, manuscript."},{"key":"10.1016\/0012-365X(89)90075-7_BIB8","first-page":"758","article-title":"A combinatorial problem","author":"de Bruijn","year":"1946","journal-title":"Koninklijke Nederlandse Academie van Wetenschappen Proc."},{"key":"10.1016\/0012-365X(89)90075-7_BIB9","series-title":"AMS short course on the mathematics of information processing","first-page":"1","article-title":"Diameter of communication networks","volume":"34","author":"Chung","year":"1986"},{"key":"10.1016\/0012-365X(89)90075-7_BIB10","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","article-title":"Line digraph iterations and the (d, k) digraph problem","volume":"vol. C-33","author":"Fiol","year":"1984","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/0012-365X(89)90075-7_BIB11","first-page":"20","article-title":"Bounds on directed (d, k) graphs","author":"Kautz","year":"1968","journal-title":"Theory of Cellular Logic Networks and Machines"},{"key":"10.1016\/0012-365X(89)90075-7_BIB12","article-title":"Extensions de r\u00e9seaux de connexit\u00e9 donn\u00e9e","author":"Konig","year":"1987","journal-title":"Proc. Coll. Combinatoire et Informatique"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89900757?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89900757?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:50:54Z","timestamp":1555134654000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X89900757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0012365X89900757"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(89)90075-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}