### Combinatorial Network Theory Kluwer by Ding-Zhu Du, D. F. Hsu

By Ding-Zhu Du, D. F. Hsu

A simple challenge for the interconnection of communications media is to layout interconnection networks for particular wishes. for instance, to lessen hold up and to maximise reliability, networks are required that experience minimal diameter and greatest connectivity below definite stipulations. The e-book presents a up to date approach to this challenge. The topic of all 5 chapters is the interconnection challenge. the 1st chapters care for Cayley digraphs that are applicants for networks of utmost connectivity with given measure and variety of nodes. bankruptcy three addresses Bruijn digraphs, Kautz digraphs, and their generalizations, that are applicants for networks of minimal diameter and greatest connectivity with given measure and variety of nodes. bankruptcy four stories double loop networks, and bankruptcy five considers broadcasting and the Gossiping challenge. all of the chapters emphasize the combinatorial facets of community thought. viewers: an important reference for graduate scholars and researchers in utilized arithmetic and theoretical desktop technological know-how.