Liaw, Sheng-Chyang; Chang, Gerard J.; Cao, Feng; Hsu, D. Frank Fault-tolerant routing in circulant networks and cycle prefix networks. (English) Zbl 0930.05035 Ann. Comb. 2, No. 2, 165-172 (1998). MSC: 05C12 05C50 PDFBibTeX XMLCite \textit{S.-C. Liaw} et al., Ann. Comb. 2, No. 2, 165--172 (1998; Zbl 0930.05035) Full Text: DOI
Du, D. Z.; Hsu, D. F.; Lyuu, Y. D. On the diameter vulnerability of Kautz digraphs. (English) Zbl 0853.05043 Discrete Math. 151, No. 1-3, 81-85 (1996). Reviewer: D.P.Brown (Carbondale) MSC: 05C20 05C38 05C12 PDFBibTeX XMLCite \textit{D. Z. Du} et al., Discrete Math. 151, No. 1--3, 81--85 (1996; Zbl 0853.05043) Full Text: DOI
Du, Ding-Zhu; Cao, Feng; Hsu, D. Frank De Bruijn digraphs, Kautz digraphs, and their generalizations. (English) Zbl 0845.05049 Du, Ding-Zhu (ed.) et al., Combinatorial network theory. Dordrecht: Kluwer Academic Publishers. Appl. Optim. 1, 65-105 (1996). Reviewer: Ján Plesník (Bratislava) MSC: 05C20 05C40 05C12 05C45 PDFBibTeX XMLCite \textit{D.-Z. Du} et al., Appl. Optim. 1, 65--105 (1996; Zbl 0845.05049)
Du, Ding-Zhu; Hsu, D. Frank; Kleitman, Daniel J. Modification of consecutive-\(d\) digraphs. (English) Zbl 0837.05079 Hsu, Frank (ed.) et al., Interconnection networks and mapping scheduling parallel computations. Proceedings of a DIMACS workshop held Feb. 7-9, 1994 at Rutgers University, New Brunswick, NJ, USA. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 21, 75-85 (1995). Reviewer: J.W.Moon (Edmonton) MSC: 05C40 05C20 PDFBibTeX XMLCite \textit{D.-Z. Du} et al., DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 21, 75--85 (1995; Zbl 0837.05079)
Hsu, D. Frank; Jia, Xing-De Extremal problems in the construction of distributed loop networks. (English) Zbl 0799.05033 SIAM J. Discrete Math. 7, No. 1, 57-71 (1994). Reviewer: J.Piehler (Merseburg) MSC: 05C35 05C20 11B13 11D04 PDFBibTeX XMLCite \textit{D. F. Hsu} and \textit{X.-D. Jia}, SIAM J. Discrete Math. 7, No. 1, 57--71 (1994; Zbl 0799.05033) Full Text: DOI
Du, D. Z.; Hsu, D. F.; Hwang, F. K. The Hamiltonian property of consecutive-\(d\) digraphs. (English) Zbl 0789.05040 Math. Comput. Modelling 17, No. 11, 61-63 (1993). Reviewer: M.Hager (Leonberg) MSC: 05C20 05C38 68R10 05C45 PDFBibTeX XMLCite \textit{D. Z. Du} et al., Math. Comput. Modelling 17, No. 11, 61--63 (1993; Zbl 0789.05040) Full Text: DOI
Du, Ding-Zhu; Lyuu, Yuh-Dauh; Hsu, D. Frank Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing. (English) Zbl 0776.05046 Graph-theoretic concepts in computer science, Proc. 17th Int. Workshop, Fischbachau/Ger. 1991, Lect. Notes Comput. Sci. 570, 169-179 (1992). Reviewer: G.Chaty (Paris) MSC: 05C20 05C40 05C38 PDFBibTeX XMLCite \textit{D.-Z. Du} et al., Lect. Notes Comput. Sci. 570, 169--179 (1992; Zbl 0776.05046)
Du, D. Z.; Hsu, D. F. On Hamiltonian consecutive-d digraphs. (English) Zbl 0729.05022 Combinatorics and graph theory, Proc. 30th Semester, Warsaw/Pol. 1987, Banach Cent. Publ. 25, 47-55 (1989). Reviewer: M.Hager (Leonberg) MSC: 05C20 05C45 05C75 PDFBibTeX XML
Bloom, G. S.; Hsu, D. F. On graceful directed graphs that are computational models of some algebraic systems. (English) Zbl 0571.05022 Graph theory with applications to algorithms and computer science, Proc. 5th Int. Conf., Kalamazoo/Mich. 1984, 89-102 (1985). Reviewer: P.Avery MSC: 05C20 05C25 05B05 05B10 05B15 PDFBibTeX XML
Bloom, Gary S.; Hsu, D. Frank On graceful digraphs and a problem in network addressing. (English) Zbl 0543.05031 Combinatorics, graph theory and computing, Proc. 13th Southeast. Conf., Boca Raton 1982, Congr. Numerantium 35, 91-103 (1982). Reviewer: P.Avery MSC: 05C20 05C99 PDFBibTeX XML