Combinatorial Network Theory

✍ Scribed by Y. O. Hamidoune (auth.), Ding-Zhu Du, D. Frank Hsu (eds.)

• Publisher: Springer US
• Year: 1996
• Tongue: English
• Leaves: 218
• Series: Applied Optimization 1
• Edition: 1
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter....Pages i-vii
Additive Group Theory Applied to Network Topology....Pages 1-39
Connectivity of Cayley Digraphs....Pages 41-64
De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations....Pages 65-105
Link-Connectivities of Extended Double Loop Networks....Pages 107-124
Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping)....Pages 125-212
Back Matter....Pages 213-213

✦ Subjects

Combinatorics; Information and Communication, Circuits; Discrete Mathematics in Computer Science; Category Theory, Homological Algebra