Edición de la obra Combinatorial network theory
| Autor | Dingzhu Du, D. Frank Hsu |
|---|---|
| Editorial | Springer |
| Fecha de publicación | December 31, 1995 |
| Idioma | inglés |
| Páginas | 220 |
| Formato | Hardcover |
| ISBN-13 | 9780792337775 |
| ISBN-10 | 0792337778 |
| OCLC | 33162463 |
| LCCN | 95041542 |
| Número de Cutter |
D812c |
A basic problem for the interconnection of communicating media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reability, 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 de 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.