{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:44Z","timestamp":1759063844967},"reference-count":14,"publisher":"Elsevier BV","issue":"1-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 Mathematics"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1016\/0012-365x(96)83094-9","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"189-204","source":"Crossref","is-referenced-by-count":9,"title":["Diameter vulnerability of iterated line digraphs"],"prefix":"10.1016","volume":"149","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"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(96)83094-9_BIB1","series-title":"Surveys in Combinatorics","first-page":"1","article-title":"Graphs and interconnection networks: diameter and vulnerability","volume":"vol. 82","author":"Bermond","year":"1983"},{"key":"10.1016\/0012-365X(96)83094-9_BIB2","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 Distrib. Comput."},{"key":"10.1016\/0012-365X(96)83094-9_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\/0012-365X(96)83094-9_BIB4","first-page":"267","article-title":"Diameter vulnerability of some large interconnection networks","volume":"66","author":"Bond","year":"1988"},{"key":"10.1016\/0012-365X(96)83094-9_BIB5","series-title":"Graphs & Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/0012-365X(96)83094-9_BIB6","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1002\/jgt.3190130603","article-title":"Maximally connected digraphs","volume":"13","author":"F\u00e0brega","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(96)83094-9_BIB7","series-title":"IEEE 1983 Conf. Proc. 10th Ann. Internat. Symp. on Computer Architecture","first-page":"174","article-title":"Line digraph iterations and the (d,k)-problem for directed graphs","author":"Fiol","year":"1983"},{"key":"10.1016\/0012-365X(96)83094-9_BIB8","first-page":"17","article-title":"Short paths and connectivity in graphs and digraphs","volume":"29B","author":"Fiol","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(96)83094-9_BIB9","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\/0012-365X(96)83094-9_BIB10","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","article-title":"Line-digraph iterations and the (d,k) problem","author":"Fiol","year":"1984","journal-title":"IEEE Trans. Comput. C-33"},{"key":"10.1016\/0012-365X(96)83094-9_BIB11","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1109\/12.8718","article-title":"Connectivity of Imase and Itoh digraphs","author":"Homobono","year":"1988","journal-title":"IEEE Trans. Comput. C-37"},{"key":"10.1016\/0012-365X(96)83094-9_BIB12","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TC.1983.1676323","article-title":"A design for directed graphs with minimum diameter","author":"Imase","year":"1983","journal-title":"IEEE Trans. Comput. C-32"},{"key":"10.1016\/0012-365X(96)83094-9_BIB13","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\/0012-365X(96)83094-9_BIB14","doi-asserted-by":"crossref","unstructured":"C. Padr\u00f3, P. Morillo and E. Llobet, Diameter-vulnerability of large bipartite digraphs, Discrete Appl. Math., to appear.","DOI":"10.1016\/0166-218X(94)00127-Y"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X96830949?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X96830949?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T11:22:20Z","timestamp":1556277740000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X96830949"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0012365X96830949"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(96)83094-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}