{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:55:05Z","timestamp":1762210505529},"reference-count":10,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6798,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1988,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that the digraphs proposed independently by Imase and Itoh, and Reddy, Pradhan and Kuhl to minimize diameters essentially retain all the nice properties of de Bruijn digraphs and yet are applicable to any number of nodes. In particular we give results on the number of loops, the link connectivities and connectivities, the embedding properties and the self\u2010routing properties for these digraphs.<\/jats:p>","DOI":"10.1002\/net.3230180105","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T22:49:56Z","timestamp":1178923796000},"page":"27-38","source":"Crossref","is-referenced-by-count":82,"title":["Generalized de Bruijn digraphs"],"prefix":"10.1002","volume":"18","author":[{"given":"D. Z.","family":"Du","sequence":"first","affiliation":[]},{"given":"F. K.","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676641"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676633"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675809"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676323"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676569"},{"key":"e_1_2_1_7_2","article-title":"Access and alignment of data in an A","volume":"24","author":"Lawrie D. H.","year":"1975","journal-title":"P. IEEE Trans. Comput."},{"key":"e_1_2_1_8_2","volume-title":"In Fault Tolerant Computing Theory and Techniques","author":"Pradhan D. K.","year":"1986"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1676101"},{"key":"e_1_2_1_10_2","volume-title":"Direct graphs with minimum diameter and maximal connectivity. School of Engineering","author":"Reddy S. M.","year":"1980"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223205"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230180105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230180105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T20:16:46Z","timestamp":1697919406000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230180105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["10.1002\/net.3230180105"],"URL":"https:\/\/doi.org\/10.1002\/net.3230180105","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}