Skip to main content
  • Book
  • © 1996

Combinatorial Network Theory

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

Buy it now

Buying options

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

Other ways to access

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

Table of contents (5 chapters)

  1. Front Matter

    Pages i-vii
  2. Connectivity of Cayley Digraphs

    • Ralph Tindell
    Pages 41-64
  3. De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations

    • Ding-Zhu Du, Feng Cao, D. Frank Hsu
    Pages 65-105
  4. Link-Connectivities of Extended Double Loop Networks

    • Frank K. Hwang, Wen-Ching Winnie Li
    Pages 107-124
  5. Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping)

    • Juraj Hromkovič, Ralf Klasing, Burkhard Monien, Regine Peine
    Pages 125-212
  6. Back Matter

    Pages 213-213

About this book

A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a recent solution to this problem. The subject of all five chapters is the interconnection problem. The first two chapters deal with Cayley digraphs which are candidates for networks of maximum connectivity with given degree and number of nodes. Chapter 3 addresses Bruijn digraphs, Kautz digraphs, and their generalizations, which are candidates for networks of minimum diameter and maximum connectivity with given degree and number of nodes. Chapter 4 studies double loop networks, and Chapter 5 considers broadcasting and the Gossiping problem. All the chapters emphasize the combinatorial aspects of network theory.
Audience: A vital reference for graduate students and researchers in applied mathematics and theoretical computer science.

Editors and Affiliations

  • University of Minnesota, USA

    Ding-Zhu Du

  • Fordham University, USA

    D. Frank Hsu

Bibliographic Information

Buy it now

Buying options

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

Other ways to access