{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:58:56Z","timestamp":1648695536765},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":6376,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1016\/0166-218x(94)00127-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"239-248","source":"Crossref","is-referenced-by-count":7,"title":["Diameter-vulnerability of large bipartite digraphs"],"prefix":"10.1016","volume":"64","author":[{"given":"C.","family":"Padr\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Morillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Llobet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00127-Y_BIB1","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/BF01110285","article-title":"On the linegraph of a directed graph","volume":"102","author":"Aigner","year":"1967","journal-title":"Math. Z"},{"key":"10.1016\/0166-218X(94)00127-Y_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\/0166-218X(94)00127-Y_BIB3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01788663","article-title":"Large fault-tolerant interconnection networks","volume":"5","author":"Bermond","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/0166-218X(94)00127-Y_BIB4","series-title":"Graph Theory and its Applications to Algorithms and Computer Science","first-page":"123","article-title":"Diameter and vulnerability in networks","author":"Bond","year":"1985"},{"key":"10.1016\/0166-218X(94)00127-Y_BIB5","first-page":"267","article-title":"Diameter vulnerability of some large interconnection networks","volume":"66","author":"Bond","year":"1988"},{"key":"10.1016\/0166-218X(94)00127-Y_BIB6","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/0166-218X(94)00127-Y_BIB7","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1002\/jgt.3190140608","article-title":"Dense bipartite digraphs","volume":"14","author":"Fiol","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(94)00127-Y_BIB8","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","article-title":"Line-digraph iterations and the (d, k) problem","volume":"33","author":"Fiol","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(94)00127-Y_BIB9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0166-218X(93)E0165-U","article-title":"Large (d, D, D\u2032, )-bipartite digraphs","volume":"59","author":"G\u00f3mez","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)00127-Y_BIB10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1002\/scj.4690170803","article-title":"Fault-tolerant processor interconnection networks","volume":"17","author":"Imase","year":"1986","journal-title":"Systems Comput. Japan"},{"key":"10.1016\/0166-218X(94)00127-Y_BIB11","first-page":"334","article-title":"On the (d, D, D, s)-digraph problem, Appl. Algebra Engrg. Comm. Comput.","volume":"356","author":"Morillo","year":"1989"},{"key":"10.1016\/0166-218X(94)00127-Y_BIB12","article-title":"Large (d, D\u2032, s) digraphs with D\u2032 = 3","author":"Padr\u00f3","year":"1992"},{"key":"10.1016\/0166-218X(94)00127-Y_BIB13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02073596","article-title":"The (\u0394, d, d\u2032, \u0394 \u2212 1)-problem with applications to computer networks","volume":"33","author":"Yebra","year":"1991","journal-title":"Ann. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400127Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400127Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:27:09Z","timestamp":1556116029000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9400127Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0166218X9400127Y"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00127-y","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}