TitleCombinatorial Network Theory [electronic resource] / edited by Ding-Zhu Du, D. Frank Hsu
ImprintBoston, MA : Springer US : Imprint: Springer, 1996
Connect tohttp://dx.doi.org/10.1007/978-1-4757-2491-2
Descript VIII, 214 p. online resource

SUMMARY

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


CONTENT

1 Additive Group Theory Applied to Network Topology -- 2 Connectivity of Cayley Digraphs -- 3 De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations -- 4 Link-Connectivities of Extended Double Loop Networks -- 5 Dissemination of Information In Interconnection Networks (Broadcasting & Gossiping)


SUBJECT

  1. Mathematics
  2. Computer science -- Mathematics
  3. Category theory (Mathematics)
  4. Homological algebra
  5. Information theory
  6. Discrete mathematics
  7. Combinatorics
  8. Mathematics
  9. Discrete Mathematics
  10. Combinatorics
  11. Information and Communication
  12. Circuits
  13. Discrete Mathematics in Computer Science
  14. Category Theory
  15. Homological Algebra