Skip to main content
SpringerLink
Log in

De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations

  • Chapter
Combinatorial Network Theory

Part of the book series: Applied Optimization ((APOP,volume 1))

Abstract

An interesting problem in network designs is as follows: Given natural numbers n and d, find a digraph (directed graph) with n vertices, each of which has outdegree at most d, to minimize the diameter and to maximize the connectivity. This is a multiobjective optimization problem. Usually, for such a problem, solution is selected based on tradeoff between two objective fuctions. However, for this problem, it is different; that is, there exists a solution which is optimal or nearly optimal to both. Such a solution comes from study of de Bruijn digraphs, Kautz digraphs, and their generalizations. In this chapter, we introduce and survey results on these subjects.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon and M. Tarsi, Colorings and Orientations of graphs, Combinatorica to appear.

    Google Scholar 

  2. J.C. Bermond, N. Homobonpo, and C. Peyrat, Large fault-tolerant interconnection networks, Graphs and Combinatorics, (1989).

    Google Scholar 

  3. J.C. Bermond, F. Comellas, and F. Hsu, Distributed loop computer networks: a survey, IEEE Trans. on Computers, to appear.

    Google Scholar 

  4. J.C. Bermond and C. Peyrat, de Bruijn and Kautz networks: a competitor for the hypercube? preprint.

    Google Scholar 

  5. J.C. Bermond and C. Peyrat, Broadcasting in de Bruijn networks, Proc. 19-th Southeastern Conference on Combinatorics, graph Theory and Computing, 1988.

    Google Scholar 

  6. J.C. Bermond, N. Homobono, and C. Peyrat, Connectivity of Kautz networks, French-Israel Conference on Combinatorics, Jerusalem, 1988.

    Google Scholar 

  7. J. Bond and A. Ivanyi, Modeling of interconnection networks using de Bruijn graphs, Proc. Thied Conference of Program Designers (A. Vitanyi ed.), Budapest, (1987) 75–88.

    Google Scholar 

  8. N.G. de Bruijn, A combinatorial problem, Nederl. Akad. Wetensh. Proc. 49 (1946) 758–764.

    MATH  Google Scholar 

  9. F. Cao, D.-Z. Du, D.F. Hsu, L. Hwang, and W. Wu, Super-line-connectivity of consecutive-d digraphs, Technical Report, Department of Computer Science, University of Minnesota, 1995.

    Google Scholar 

  10. F. K. Chung, Diameter of communication networks, Proceedings of Symposia in Applied Mathematics, 34 (1986) 1–18.

    Article  Google Scholar 

  11. D.-Z. Du, D.F. Hsu, and F.K. Hwang, Doubly-linked ring networks, IEEE Trans. on Computers, C-34 (1985) 853–855.

    Google Scholar 

  12. D.-Z. Du, D.F. Hsu, and F.K. Hwang, Hamiltonian property of d-consecutive digraphs, Mathematical and Comput. Modeling17: 11 (1993) 61–63.

    Article  MathSciNet  MATH  Google Scholar 

  13. D.-Z. Du, D.F. Hsu, F.K. Hwang and X.M. Zhang, The Hamiltonian property of generalized de Bruijn digraphs, J. Comb. Theory (Series B), 52 (1991) 1–8.

    Article  MathSciNet  MATH  Google Scholar 

  14. D.-Z. Du and D.F. Hsu, On Hamiltonian consecutive-d digraphs, Banach Center Publication, 22 (1989).

    Google Scholar 

  15. D.-Z. Du and F.K. Hwang, Generalized de Bruijn digraphs, Networks, 18(1988) 27–33.

    Article  MathSciNet  MATH  Google Scholar 

  16. D.-Z. Du, D.F. Hsu, and Y.D. Lyuu, On the diameter vulnerability of Kautz digraphs, to appear.

    Google Scholar 

  17. D.-Z. Du, D.F. Hsu, and D.J. Kleitman, On connectivity of consecutive-d digraphs, manuscript.

    Google Scholar 

  18. D.-Z. Du, D.F. Hsu, and D.J. Kleitman, Modification of consecutive-d digraphs, to appear.

    Google Scholar 

  19. D.Z. Du, D.F. Hsu and G.W. Peck, Connectivity of consecutive-d digraphs, Discrete Applied Mathematics 37/38 (1992) 169–177.

    Article  MathSciNet  Google Scholar 

  20. J. Fabrega, M.A. Fiol, and M. Escudero, The connectivity of iterated line digraphs, J. of Graph Theory, to appear.

    Google Scholar 

  21. C.T. Fan, S.M. Fan, S.L. Ma, and M.K. Siu, On de Bruijn arrays, Ars Combin. 19A (1985) 205–213.

    MathSciNet  MATH  Google Scholar 

  22. M.R. Fellow, Transversals of vertex partitions of graphs, SIAM J. Disc. Math. 3 (1990) 206–215.

    Article  Google Scholar 

  23. 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 (1984) 702–713.

    Article  Google Scholar 

  24. H. Fleischner and M. Stiebitz, A solution to a colouring problem of P. Edös, manuscript.

    Google Scholar 

  25. B. Gao, private communication.

    Google Scholar 

  26. N. Homobono, Connectivity of generalized de Bruijn and Kautz graphs, Proc. 11-th British Conference, Ars Combinatoria, (1988).

    Google Scholar 

  27. N. Homobono and C. Peyrat, Connectivity of Imase and Itoh digraphs, IEEE Trans. on Computers, (1988).

    Google Scholar 

  28. F.K. Hwang, The Hamiltonian property of linear functions, Operations Research Letters, 6 (1987) 125–127.

    Article  MathSciNet  MATH  Google Scholar 

  29. F.K. Hwang, Broadcasting in a 3-stage point-to-point nonblocking networks, manuscript.

    Google Scholar 

  30. M. Imase and M. Itoh, Design to minimize a diameter on Building block network, IEEE Trans. on Computers, C-30 (1981) 439–443.

    Article  MathSciNet  Google Scholar 

  31. M. Imase and M. Itoh, A design for directed graph with minimum diameter, IEEE Trans. on Computers, C-32 (1983) 782–784.

    Article  Google Scholar 

  32. M. Imase, T. Soneoka, and K. Okada, Connectivity of regular directed graphs with small diameter, IEEE Trans. on Computers, C-34 (1985) 267–273.

    Article  MathSciNet  Google Scholar 

  33. M. Imase, I. Soneoka, and K. Okada, A fault tolerant processor interconnection network, Systems and Computers in Japan, 17:8 (1986) 21–30.

    Article  Google Scholar 

  34. W.H. Kautz, Bounds on directed (d, k) graphs, Theory of cellular logic networks and machines, AFCRL-68–0668 Final Report, (1968) 20–28.

    Google Scholar 

  35. V.P. Kumar and S.M. Reddy, A class of graphs for fault-tolerant processor interconnections, IEEE 1984 Int. Conf. Distributed Computing Systems, (1984) 448–460.

    Google Scholar 

  36. A. Lempel, On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers, IEEE Trans. Computers C-19 (1970) 1204–1209.

    Article  MathSciNet  Google Scholar 

  37. M.L. Liu, Homomorphisms and automorphisms of 2-D de Bruijn-Good graphs, Discrete Mathematics 85 (1990) 105–109.

    Article  MathSciNet  MATH  Google Scholar 

  38. M.L. Liu, Automorphisms of 2-D de Bruijn graphs, Kexue Tongbao 2 (1990) 84–87.

    Google Scholar 

  39. M.L. Liu and S.M. Lee, The category of the de Bruijn-Good graphs, Journal of Graduate School 1 (1984) 12–15.

    MATH  Google Scholar 

  40. J. Plesnik and S. Znam, Strongly geodetic directed graphs, in Recent Advances in Graph Theory, Proc. Symp., Prague, Academia Prague, (1975) 455–465.

    Google Scholar 

  41. S.M. Reddy, J.G. Kuhl, S.H. Hosseini, and H. Lee, On digraphs with minimum diameter and maximum connectivity, Proc. of 20-th Annual Allerton Conference, (1982) 1018–1026.

    Google Scholar 

  42. S.M. Reddy, D.K. Pradhan, and J.G. Kuhl, Directed graphs with minimal diameter and maximal connectivity, School of Engineering Oakland Univ. Tech. Rep., 1980.

    Google Scholar 

  43. T. Soneoka, Super edge-connectivity of generalized de Bruijn digraphs, preprint.

    Google Scholar 

  44. T. Soneoka, H. Nakada, and M. Imase, Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter, Preprint.

    Google Scholar 

  45. T. Soneoka, M. Imase, and Y. Manabe, Design of d-connected digraph with a minimum number of edvges and a quasiminimal diameter II, preprint.

    Google Scholar 

  46. Z.X. Wan and M.L. Liu, The automorphisms and homomorphisms of de Bruijn graphs, Acta Math. Sinica 22 (1979) 170–177.

    MathSciNet  MATH  Google Scholar 

  47. D.B. West, Open problems, SIAM Discrete Math. Newsletter1(3) (1991) 9–12.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Minnesota, USA

    Ding-Zhu Du & Feng Cao

  2. Fordham University, USA

    D. Frank Hsu

Authors
  1. Ding-Zhu Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feng Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Frank Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Minnesota, USA

    Ding-Zhu Du

  2. Fordham University, USA

    D. Frank Hsu

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Du, DZ., Cao, F., Hsu, D.F. (1996). De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations. In: Du, DZ., Hsu, D.F. (eds) Combinatorial Network Theory. Applied Optimization, vol 1. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2491-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2491-2_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4752-9

  • Online ISBN: 978-1-4757-2491-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation