Zhang, Peng; Deng, Yuefan An analysis of the topological properties of the interlaced bypass torus (iBT) networks. (English) Zbl 1259.68014 Appl. Math. Lett. 25, No. 12, 2147-2155 (2012). MSC: 68M10 PDF BibTeX XML Cite \textit{P. Zhang} and \textit{Y. Deng}, Appl. Math. Lett. 25, No. 12, 2147--2155 (2012; Zbl 1259.68014) Full Text: DOI OpenURL
Kuo, Jyhmin On the twin domination number in generalized de Bruijn and generalized Kautz digraphs. (English) Zbl 1214.05045 Discrete Math. Algorithms Appl. 2, No. 2, 199-205 (2010). MSC: 05C20 05C69 PDF BibTeX XML Cite \textit{J. Kuo}, Discrete Math. Algorithms Appl. 2, No. 2, 199--205 (2010; Zbl 1214.05045) Full Text: DOI OpenURL
Delvenne, Jean-Charles; Carli, Ruggero; Zampieri, Sandro Optimal strategies in the average consensus problem. (English) Zbl 1181.93009 Syst. Control Lett. 58, No. 10-11, 759-765 (2009). MSC: 93A14 94C15 PDF BibTeX XML Cite \textit{J.-C. Delvenne} et al., Syst. Control Lett. 58, No. 10--11, 759--765 (2009; Zbl 1181.93009) Full Text: DOI arXiv OpenURL
Lin, Cheng-Kuan; Ho, Tung-Yang; Tan, Jimmy J. M.; Hsu, Lih-Hsing Fault-tolerant hamiltonicity and fault-tolerant Hamiltonian connectivity of the folded Petersen cube networks. (English) Zbl 1158.68432 Int. J. Comput. Math. 86, No. 1, 57-66 (2009). MSC: 68R10 PDF BibTeX XML Cite \textit{C.-K. Lin} et al., Int. J. Comput. Math. 86, No. 1, 57--66 (2009; Zbl 1158.68432) Full Text: DOI OpenURL
Deng, Zhi-Guo; Xu, Bao-Gen The independence number for de Bruijn networks and Kautz networks. (English) Zbl 1183.05056 Discrete Appl. Math. 156, No. 15, 3035-3039 (2008). MSC: 05C69 PDF BibTeX XML Cite \textit{Z.-G. Deng} and \textit{B.-G. Xu}, Discrete Appl. Math. 156, No. 15, 3035--3039 (2008; Zbl 1183.05056) Full Text: DOI OpenURL
Qiu, Ke; Das, Sajal K. Interconnection networks and their eigenvalues. (English) Zbl 1101.68436 Int. J. Found. Comput. Sci. 14, No. 3, 371-389 (2003). MSC: 68M99 68M10 PDF BibTeX XML Cite \textit{K. Qiu} and \textit{S. K. Das}, Int. J. Found. Comput. Sci. 14, No. 3, 371--389 (2003; Zbl 1101.68436) Full Text: DOI OpenURL
Pendavingh, Rudi; Schuurman, Petra; Woeginger, Gerhard J. Recognizing DNA graphs is difficult. (English) Zbl 1037.92018 Discrete Appl. Math. 127, No. 1, 85-94 (2003). MSC: 92C40 05C90 05C15 05C78 05C20 PDF BibTeX XML Cite \textit{R. Pendavingh} et al., Discrete Appl. Math. 127, No. 1, 85--94 (2003; Zbl 1037.92018) Full Text: DOI OpenURL
Suri, Neeraj; Mendelson, Avi Design of a parallel interconnect based on communication pattern considerations. (English) Zbl 0981.68017 Parallel Algorithms Appl. 16, No. 4, 243-271 (2001). MSC: 68M99 68W10 68M10 PDF BibTeX XML Cite \textit{N. Suri} and \textit{A. Mendelson}, Parallel Algorithms Appl. 16, No. 4, 243--271 (2001; Zbl 0981.68017) Full Text: DOI OpenURL
Mao, Jyh-Wen; Yang, Chang-Biau Shortest path routing and fault-tolerant routing on de Bruijn networks. (English) Zbl 0967.68011 Networks 35, No. 3, 207-215 (2000). MSC: 68M10 90B10 90C35 PDF BibTeX XML Cite \textit{J.-W. Mao} and \textit{C.-B. Yang}, Networks 35, No. 3, 207--215 (2000; Zbl 0967.68011) Full Text: DOI OpenURL
Al-Ayyoub, Abdel-Elah; Day, Khaled Unified parallel algorithms for Gaussian elimination with backward substitution on product networks. (English) Zbl 0955.68127 Parallel Algorithms Appl. 14, No. 4, 253-269 (2000). MSC: 68W10 68R10 PDF BibTeX XML Cite \textit{A.-E. Al-Ayyoub} and \textit{K. Day}, Parallel Algorithms Appl. 14, No. 4, 253--269 (2000; Zbl 0955.68127) Full Text: DOI OpenURL
Heinrich, D.; Langdeau, D.; Verrall, H. Covering 2-paths uniformly. (English) Zbl 0946.05022 J. Comb. Des. 8, No. 2, 100-121 (2000). Reviewer: L.Teirlinck (Auburn) MSC: 05B40 05C38 05C45 05C20 05C70 PDF BibTeX XML Cite \textit{D. Heinrich} et al., J. Comb. Des. 8, No. 2, 100--121 (2000; Zbl 0946.05022) Full Text: DOI OpenURL
Chen, Gen-Huey; Fu, Jung-Sheng; Fang, Jywe-Fei Hypercomplete: a pancyclic recursive topology for large-scale distributed multicomputer systems. (English) Zbl 0938.90066 Networks 35, No. 1, 56-69 (2000). MSC: 90C35 68M10 68R10 PDF BibTeX XML Cite \textit{G.-H. Chen} et al., Networks 35, No. 1, 56--69 (2000; Zbl 0938.90066) Full Text: DOI OpenURL
Calamoneri, Tiziana; Petreschi, Rossella Optimal layout of trivalent Cayley interconnection networks. (English) Zbl 1319.68154 Int. J. Found. Comput. Sci. 10, No. 3, 277-287 (1999). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{T. Calamoneri} and \textit{R. Petreschi}, Int. J. Found. Comput. Sci. 10, No. 3, 277--287 (1999; Zbl 1319.68154) Full Text: DOI OpenURL
Chen, Guihai; Lau, Francis C. M. Shuffle-ring: A new constant-degree network. (English) Zbl 0967.68010 Int. J. Found. Comput. Sci. 9, No. 1, 77-98 (1998). MSC: 68M10 PDF BibTeX XML Cite \textit{G. Chen} and \textit{F. C. M. Lau}, Int. J. Found. Comput. Sci. 9, No. 1, 77--98 (1998; Zbl 0967.68010) Full Text: DOI OpenURL
Rolim, José; Tvrdík, Pavel; Trdlička, Jan; Vrto, Imrich Bisecting de Bruijn and Kautz graphs. (English) Zbl 0907.68140 Discrete Appl. Math. 85, No. 1, 87-97 (1998). Reviewer: T.Andreae (Hamburg) MSC: 68R10 94C15 05C35 05C20 PDF BibTeX XML Cite \textit{J. Rolim} et al., Discrete Appl. Math. 85, No. 1, 87--97 (1998; Zbl 0907.68140) Full Text: DOI Link OpenURL
Tvrdik, Pavel; Harbane, Rabah; Heydemann, Marie-Claude Uniform homomorphisms of de Bruijn and Kautz networks. (English) Zbl 0902.68078 Discrete Appl. Math. 83, No. 1-3, 279-301 (1998). MSC: 68Q10 05C20 PDF BibTeX XML Cite \textit{P. Tvrdik} et al., Discrete Appl. Math. 83, No. 1--3, 279--301 (1998; Zbl 0902.68078) Full Text: DOI Link OpenURL
Wagh, Meghanad D.; Mo, Jiancheng Hamilton cycles in Trivalent Cayley graphs. (English) Zbl 0900.68075 Inf. Process. Lett. 60, No. 4, 177-181 (1997). MSC: 68M99 68W15 PDF BibTeX XML Cite \textit{M. D. Wagh} and \textit{J. Mo}, Inf. Process. Lett. 60, No. 4, 177--181 (1997; Zbl 0900.68075) Full Text: DOI OpenURL
Feldmann, Rainer; Monien, Burkhard; Mysliwietz, Peter; Tschöke, Stefan A better upper bound on the bisection width of de Bruijn networks (extended abstract). (English) Zbl 1498.68203 Reischuk, Rüdiger (ed.) et al., STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1200, 511-522 (1997). MSC: 68R10 05C70 PDF BibTeX XML Cite \textit{R. Feldmann} et al., Lect. Notes Comput. Sci. 1200, 511--522 (1997; Zbl 1498.68203) Full Text: DOI OpenURL
Andreae, Thomas; Hintz, Martin; Nölle, Michael; Schreiber, Gerald; Schuster, Gerald W.; Seng, Hajo Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three. (English) Zbl 0886.05074 Discrete Appl. Math. 79, No. 1-3, 3-34 (1997). Reviewer: W.-K.Chen (Chicago) MSC: 05C20 05C10 05C38 68R10 PDF BibTeX XML Cite \textit{T. Andreae} et al., Discrete Appl. Math. 79, No. 1--3, 3--34 (1997; Zbl 0886.05074) Full Text: DOI Link OpenURL
Barth, Dominique; Heydemann, Marie-Claude A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs. (English) Zbl 0878.05041 Discrete Appl. Math. 77, No. 2, 99-118 (1997); errata ibid. 80, 115 (1997). MSC: 05C20 05C70 PDF BibTeX XML Cite \textit{D. Barth} and \textit{M.-C. Heydemann}, Discrete Appl. Math. 77, No. 2, 99--118 (1997; Zbl 0878.05041) Full Text: DOI Link OpenURL
Vadapalli, Premkumar; Srimani, Pradip K. Shortest routing in trivalent Cayley graph network. (English) Zbl 0900.68330 Inf. Process. Lett. 57, No. 4, 183-188 (1996). MSC: 68R10 05C85 05C25 68M10 PDF BibTeX XML Cite \textit{P. Vadapalli} and \textit{P. K. Srimani}, Inf. Process. Lett. 57, No. 4, 183--188 (1996; Zbl 0900.68330) Full Text: DOI OpenURL
Feldmann, R.; Mysliwietz, P. The shuffle exchange network has a Hamiltonian path. (English) Zbl 0861.68006 Math. Syst. Theory 29, No. 5, 471-485 (1996). MSC: 68M10 PDF BibTeX XML Cite \textit{R. Feldmann} and \textit{P. Mysliwietz}, Math. Syst. Theory 29, No. 5, 471--485 (1996; Zbl 0861.68006) Full Text: DOI OpenURL
Bermond, Jean-Claude; Ergincan, Fahir Ö. Bus interconnection networks. (English) Zbl 0852.05066 Discrete Appl. Math. 68, No. 1-2, 1-15 (1996). Reviewer: T.Andreae (Hamburg) MSC: 05C65 94C15 68M10 90B18 PDF BibTeX XML Cite \textit{J.-C. Bermond} and \textit{F. Ö. Ergincan}, Discrete Appl. Math. 68, No. 1--2, 1--15 (1996; Zbl 0852.05066) Full Text: DOI OpenURL
Heydemann, M. C.; Sotteau, D. A note on recursive properties of the de Bruijn, Kautz and FFT digraphs. (English) Zbl 0875.68683 Inf. Process. Lett. 53, No. 5, 255-259 (1995). MSC: 68R10 PDF BibTeX XML Cite \textit{M. C. Heydemann} and \textit{D. Sotteau}, Inf. Process. Lett. 53, No. 5, 255--259 (1995; Zbl 0875.68683) Full Text: DOI OpenURL
Vadapalli, Premkumar; Srimani, Pradip K. Trivalent Cayley graphs for interconnection networks. (English) Zbl 0875.68688 Inf. Process. Lett. 54, No. 6, 329-335 (1995). MSC: 68R10 PDF BibTeX XML Cite \textit{P. Vadapalli} and \textit{P. K. Srimani}, Inf. Process. Lett. 54, No. 6, 329--335 (1995; Zbl 0875.68688) Full Text: DOI OpenURL
Nanavati, A. A.; Iyengar, S. S.; El-Amawy, A. Topological properties of the recursive Petersen architecture. (English) Zbl 0833.68010 Math. Comput. Modelling 21, No. 11, 23-33 (1995). MSC: 68M10 68R10 PDF BibTeX XML Cite \textit{A. A. Nanavati} et al., Math. Comput. Modelling 21, No. 11, 23--33 (1995; Zbl 0833.68010) Full Text: DOI OpenURL
Klasing, Ralf; Monien, Burkhard; Peine, Regine; Stöhr, Elena A. Broadcasting in butterfly and deBruijn networks. (English) Zbl 0807.94035 Discrete Appl. Math. 53, No. 1-3, 183-197 (1994). MSC: 68M10 68R10 90B18 PDF BibTeX XML Cite \textit{R. Klasing} et al., Discrete Appl. Math. 53, No. 1--3, 183--197 (1994; Zbl 0807.94035) Full Text: DOI OpenURL
Koung, C. C.; Opatrny, J. Multidimensional linear congruential graphs. (English) Zbl 0883.68101 RAIRO, Inform. Théor. Appl. 28, No. 3-4, 187-199 (1994). MSC: 68R10 PDF BibTeX XML Cite \textit{C. C. Koung} and \textit{J. Opatrny}, RAIRO, Inform. Théor. Appl. 28, No. 3--4, 187--199 (1994; Zbl 0883.68101) Full Text: DOI EuDML OpenURL
Rosenberg, Arnold L. Product-shuffle networks: Toward reconciling shuffles and butterflies. (English) Zbl 0770.94011 Discrete Appl. Math. 37-38, 465-488 (1992). Reviewer: K.G.Brokate (Leonberg) MSC: 94C15 PDF BibTeX XML Cite \textit{A. L. Rosenberg}, Discrete Appl. Math. 37--38, 465--488 (1992; Zbl 0770.94011) Full Text: DOI OpenURL
Das, Sajal K.; Ghosh, Joydeep; Deo, Narsingh Stirling networks: A versatile combinatorial topology for multiprocessor systems. (English) Zbl 0768.68134 Discrete Appl. Math. 37-38, 119-146 (1992). MSC: 68R10 68W15 68W35 05C05 05C10 05C78 PDF BibTeX XML Cite \textit{S. K. Das} et al., Discrete Appl. Math. 37--38, 119--146 (1992; Zbl 0768.68134) Full Text: DOI OpenURL
Feldmann, Rainer; Mysliwietz, Peter The shuffle exchange network has a Hamiltonian path. (English) Zbl 1494.68193 Havel, Ivan M. (ed.) et al., Mathematical foundations of computer science 1992. 17th international symposium, Prague, Czechoslovakia, August 24–28, 1992. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 629, 246-254 (1992). MSC: 68R10 05C45 PDF BibTeX XML Cite \textit{R. Feldmann} and \textit{P. Mysliwietz}, Lect. Notes Comput. Sci. 629, 246--254 (1992; Zbl 1494.68193) Full Text: DOI OpenURL
Klasing, R.; Monien, B.; Peine, R.; Stöhr, E. Broadcasting in butterfly and deBruijn networks (extended abstract). (English) Zbl 1494.68020 Finkel, A. (ed.) et al., STACS 92. Theoretical aspects of computer science. Proceedings of the 9th annual symposium, Cachan, France, February 13–15, 1992. Berlin: Springer. Lect. Notes Comput. Sci. 577, 351-362 (1992). MSC: 68M10 68R10 90B18 PDF BibTeX XML Cite \textit{R. Klasing} et al., Lect. Notes Comput. Sci. 577, 351--362 (1992; Zbl 1494.68020) Full Text: DOI OpenURL
Rosenberg, Arnold L. Exposing graph uniformities via algebraic specification. (English) Zbl 0735.68060 Math. Syst. Theory 23, No. 4, 227-244 (1990). Reviewer: W.Lex MSC: 68Q65 68M10 PDF BibTeX XML Cite \textit{A. L. Rosenberg}, Math. Syst. Theory 23, No. 4, 227--244 (1990; Zbl 0735.68060) Full Text: DOI OpenURL
Bhattacharya, Prabir Decomposition of de Bruijn graphs. (English) Zbl 0825.68486 Int. J. Comput. Math. 33, No. 1-2, 71-75 (1990). MSC: 68R10 PDF BibTeX XML Cite \textit{P. Bhattacharya}, Int. J. Comput. Math. 33, No. 1--2, 71--75 (1990; Zbl 0825.68486) Full Text: DOI OpenURL