Skip to main content

On the External Stability Number of the Generalized De Bruijn Graphs

  • Chapter
Discrete Analysis and Operations Research

Part of the book series: Mathematics and Its Applications ((MAIA,volume 355))

  • 300 Accesses

Abstract

In the paper we study the external stability number of the generalized de Bruijn graphs B(m, d), where m is the number of vertices and d is the number of arcs leaving every vertex. For the ordinary de Bruijn graphs as well as for graphs with even d and m ≡ 0 (mod (d + 1)) we establish an exact value of the external stability number equal to the obvious lower bound [m/(d + 1)]. We show an example of the graph B(35, 2) implying that this bound is not tight in general case.

This research was partially supported by the Russian Foundation for Fundamental Research (Grant 93–01–01484).

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

Access this chapter

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. S. Toueg and K. Steiglitz (1979) The design of small-diameter networks by local search, IEEE Trans. Comput 28, No. 7, 537–542.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. Ayoub and I. Frisch (1970) Optimally invulnerable directed communication networks, IEEE Trans. Comm. 18, 484–489.

    Article  Google Scholar 

  3. M. Imase and M. Itoh (1983) A design method for directed graphs with minimum diameter, IEEE Trans. Comput. 32, No. 8, 782–784.

    Article  MATH  Google Scholar 

  4. M. Imase M. and M. Itoh (1981) Design to minimize diameters on building-block network, IEEE Trans. Comput. 30, No. 6, 439–442.

    Article  MathSciNet  MATH  Google Scholar 

  5. S. M. Reddy, D. K. Pradham, and J. G. Kuhl (1980) Directed graphs with minimum diameter and maximal connectivity, Tech. Rep. School Eng. Rochester, Oakland Univ., MI.

    Google Scholar 

  6. D. Z. Du and F. K. Hwang (1988) Generalized de Bruijn digraphs, Networks 18, No. 1, 27–38.

    Article  MathSciNet  MATH  Google Scholar 

  7. D. Z. Du, D. F. Hsu, F. K. Hwang and X. M. Zhang (1991) The Hamiltonian property of generalized de Bruijn digraphs, J. Combin. Theory. Ser. В. 52, No. 1, 1–8.

    Article  MathSciNet  MATH  Google Scholar 

  8. L. M. Hu (1992) Enumeration of Euler circuits and Hamiltonian cycles in generalized de Bruijn digraphs J. China Univ. Sci. Tech. 22, No. 3, 375–384.

    MathSciNet  Google Scholar 

  9. C. Berg (1958) Théorie des Graphes et ses Applications, Dunod, Paris.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Kluwer Academic Publishers

About this chapter

Cite this chapter

Nyu, V. (1996). On the External Stability Number of the Generalized De Bruijn Graphs. In: Korshunov, A.D. (eds) Discrete Analysis and Operations Research. Mathematics and Its Applications, vol 355. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-1606-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-1606-7_15

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-7217-5

  • Online ISBN: 978-94-009-1606-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics