{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:12Z","timestamp":1725663612232},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551218"},{"type":"electronic","value":"9783540467359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55121-2_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:47:28Z","timestamp":1330249648000},"page":"169-179","source":"Crossref","is-referenced-by-count":3,"title":["Line digraph iterations and the spread concept\u2014with application to graph theory, fault tolerance, and routing"],"prefix":"10.1007","author":[{"given":"Ding-Zhu","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuh-Dauh","family":"Lyuu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. Frank","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"issue":"No.2","key":"16_CR1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01788663","volume":"5","author":"J.-C. Bermond","year":"1989","unstructured":"J.-C. Bermond, N. Homobono, and C. Peyrat, Large Fault-Tolerant Interconnection Networks, Graphs and Combinatorics, 5, No. 2 (1989), pp. 107\u2013123.","journal-title":"Graphs and Combinatorics"},{"key":"16_CR2","first-page":"17","volume-title":"Beitr\u00e4ge zur Graphentheorie","author":"L.W. Beineke","year":"1968","unstructured":"L.W. Beineke, On Derived Graphs and Digraphs, Beitr\u00e4ge zur Graphentheorie, Teubner, Leipzig, 1968, pp. 17\u201323."},{"key":"16_CR3","volume-title":"Extremal Graphs Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"B. Bollob\u00e1s, Extremal Graphs Theory, Academic Press, New York, 1978."},{"key":"16_CR4","volume-title":"Distance in Graphs","author":"F. Buckley","year":"1990","unstructured":"F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, Reading, Massachusetts, 1990."},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/BF01350320","volume":"182","author":"G. Chartrand","year":"1969","unstructured":"G. Chartrand and M.J. Stewart, The Connectivity of Line-Graphs, Mathematische Annalen 182 (1969), pp. 170\u2013174.","journal-title":"Mathematische Annalen"},{"issue":"No.5","key":"16_CR6","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","volume":"C-33","author":"M.A. Fiol","year":"1984","unstructured":"M.A. Fiol, J.L.A. Yebra, and I. Alegre, Line Digraph Iterations and the (d,k) Digraph Problem, IEEE Trans. on Computers, C-33, No. 5 (May 1984), pp. 400\u2013403.","journal-title":"IEEE Trans. on Computers"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF02854581","volume":"9","author":"F. Harary","year":"1960","unstructured":"F. Harary and R.Z. Norman, Some Properties of Line Digraphs, Rendiconti del Circolo Matematico di Palermo, 9 (1960), pp. 161\u2013168.","journal-title":"Rendiconti del Circolo Matematico di Palermo"},{"key":"16_CR8","unstructured":"D.F. Hsu and Y.-D. Lyuu, A Graph-Theoretical Study of Transmission Delay and Fault Tolerance, to appear in Proc. Fourth ISMM International Conference on Parallel and Distributed Computing and Systems, 1991."},{"issue":"No.3","key":"16_CR9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TC.1985.1676569","volume":"C-34","author":"M. Imase","year":"1985","unstructured":"M. Imase, T. Soneoka, and K. Okada, Connectivity of Regular Directed Graphs with Small Diameters, IEEE Trans. on Computers, C-34, No. 3 (March 1985), pp. 267\u2013273.","journal-title":"IEEE Trans. on Computers"},{"issue":"No.8","key":"16_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1002\/scj.4690170803","volume":"17","author":"M. Imase","year":"1986","unstructured":"M. Imase, T. Soneoka, and K. Okada, Fault-Tolerant Processor Interconnection Networks, Systems and Computers in Japan, 17, No. 8 (August 1986), pp. 21\u201330. Translated from Denshi Tsushin Gakkai Ronbunshi, 68-D, No. 8 (August 1985), pp. 1449\u20131456.","journal-title":"Systems and Computers in Japan"},{"key":"16_CR11","unstructured":"W.H. Kautz, Bounds on Directed (d, k) Graphs, Theory of Cellular Logic Networks and Machines, AFCKL-68-0668 Final Report, 1968, pp. 20\u201328."},{"issue":"No.4","key":"16_CR12","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/12.2194","volume":"C-37","author":"F.J. Meyer","year":"1988","unstructured":"F.J. Meyer and D.K. Pradhan, Flip-Trees: Fault-Tolerant Graphs with Wide Containers, IEEE Trans. on Computers, C-37, No. 4 (April 1988), pp. 472\u2013478.","journal-title":"IEEE Trans. on Computers"},{"issue":"No.9","key":"16_CR13","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1109\/TC.1982.1676101","volume":"C-31","author":"D.K. Pradhan","year":"1982","unstructured":"D.K. Pradhan and S.M. Reddy, A Fault-Tolerant Communication Architecture for Distributed Systems, IEEE Trans. on Computers, C-31, No. 9 (September 1982), pp. 863\u2013870.","journal-title":"IEEE Trans. on Computers"},{"issue":"No.2","key":"16_CR14","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M.O. Rabin","year":"1989","unstructured":"M.O. Rabin, Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance, J. ACM, 36, No. 2 (April 1989), pp. 335\u2013348.","journal-title":"J. ACM"},{"key":"16_CR15","unstructured":"S.M. Reddy, J.G. Kuhl, S.H. Hosseini, and H. Lee, On Digraphs with Minimum Diameter and Maximum Connectivity, Proc. 20th Annual Allerton Conference on Communication, Control, and Computing, 1982, pp. 1018\u20131026."},{"issue":"No.7","key":"16_CR16","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","volume":"C-37","author":"Y. Saad","year":"1988","unstructured":"Y. Saad and M.H. Schultz, Topological Properties of Hypercubes, IEEE Trans. on Computers, C-37, No. 7 (July 1988), pp. 867\u2013872.","journal-title":"IEEE Trans. on Computers"},{"issue":"No.4","key":"16_CR17","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1109\/12.21149","volume":"C-38","author":"M.R. Samatham","year":"1989","unstructured":"M.R. Samatham and D.K. Pradhan, The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI, IEEE Trans. on Computers, C-38, No. 4 (April 1989), pp. 567\u2013581.","journal-title":"IEEE Trans. on Computers"},{"key":"16_CR18","volume-title":"Computer Networks","author":"A.S. Tanenbaum","year":"1981","unstructured":"A.S. Tanenbaum, Computer Networks, Englewood Cliffs, Prentice-Hall, New Jersey, 1981."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55121-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:28:02Z","timestamp":1619573282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55121-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551218","9783540467359"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-55121-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}