{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T01:21:57Z","timestamp":1697678517668},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":4156,"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":[[2002,3]]},"DOI":"10.1016\/s0166-218x(00)00333-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:52:51Z","timestamp":1027583571000},"page":"15-26","source":"Crossref","is-referenced-by-count":8,"title":["Connectivity and fault-tolerance of hyperdigraphs"],"prefix":"10.1016","volume":"117","author":[{"given":"Daniela","family":"Ferrero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carles","family":"Padr\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00333-4_BIB1","unstructured":"J.C. Bermond, F. Ergincan, Directed line hypergraphs, private communication."},{"key":"10.1016\/S0166-218X(00)00333-4_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(95)00046-T","article-title":"Bus interconnection networks","volume":"68","author":"Bermond","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00333-4_BIB3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<205::AID-NET5>3.0.CO;2-P","article-title":"De Bruijn and Kautz Bus Networks","volume":"30","author":"Bermond","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00333-4_BIB4","first-page":"758","article-title":"A combinatorial problem","volume":"A49","author":"de Bruijn","year":"1946","journal-title":"Koninklijke Nederlandse Academie van Wetenschappen Proc."},{"key":"10.1016\/S0166-218X(00)00333-4_BIB5","first-page":"657","article-title":"Maximally connected digraphs","volume":"13-6","author":"F\u00e0brega","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(00)00333-4_BIB6","doi-asserted-by":"crossref","unstructured":"D. Ferrero, C. Padr\u00f3, New bounds on the diameter vulnerability of iterated line digraphs, Discrete Math., to appear.","DOI":"10.1016\/S0012-365X(00)00230-2"},{"key":"10.1016\/S0166-218X(00)00333-4_BIB7","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","article-title":"Line-digraph Iterations and the (d,k) Problem","volume":"C-33","author":"Fiol","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(00)00333-4_BIB8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","article-title":"Directed hypergraphs and applications","volume":"42","author":"Gallo","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00333-4_BIB9","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1109\/12.8718","article-title":"Connectivity of Imase and Itoh digraphs","volume":"C-37","author":"Homobono","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(00)00333-4_BIB10","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TC.1981.1675809","article-title":"Design to Minimize Diameter in Building-Block Network","volume":"C-30","author":"Imase","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(00)00333-4_BIB11","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TC.1983.1676323","article-title":"A design for directed graphs with minimum diameter","volume":"C-32","author":"Imase","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(00)00333-4_BIB12","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. Jpn."},{"key":"10.1016\/S0166-218X(00)00333-4_BIB13","unstructured":"W.H. Kautz, Bounds on directed (d,k) graphs, Theory of cellular logic networks and machines, AFCRL-68-0668 Final Report, 1968, pp. 20\u201328."},{"key":"10.1016\/S0166-218X(00)00333-4_BIB14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(96)83094-9","article-title":"Diameter-vulnerability of iterated line digraphs","volume":"149","author":"Padr\u00f3","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(00)00333-4_BIB15","unstructured":"S.M. Reddy, D.K. Pradham, J. Kuhl, Directed graphs with minimum diameter and maximum connectivity, Technical Report, School of Engineering Oakland University, Rochester, MI 1980."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003334?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003334?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T23:51:06Z","timestamp":1557100266000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0166218X00003334"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00333-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}