"Combinatorial Network Theory" - Information and Links:

Combinatorial Network Theory - Info and Reading Options

Book's cover
The cover of “Combinatorial Network Theory” - Open Library.

"Combinatorial Network Theory" was published by Springer US in 1996 - Boston, MA, it has 213 pages and the language of the book is English.


“Combinatorial Network Theory” Metadata:

  • Title: Combinatorial Network Theory
  • Author:
  • Language: English
  • Number of Pages: 213
  • Publisher: Springer US
  • Publish Date:
  • Publish Location: Boston, MA

“Combinatorial Network Theory” Subjects and Themes:

Edition Specifications:

  • Format: [electronic resource] /
  • Pagination: ➤  1 online resource (vii, 213 p.)

Edition Identifiers:

AI-generated Review of “Combinatorial Network Theory”:


"Combinatorial Network Theory" Description:

The Open Library:

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.

Open Data:

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

Read “Combinatorial Network Theory”:

Read “Combinatorial Network Theory” by choosing from the options below.

Search for “Combinatorial Network Theory” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Combinatorial Network Theory” in Libraries Near You:

Read or borrow “Combinatorial Network Theory” from your local library.

Buy “Combinatorial Network Theory” online:

Shop for “Combinatorial Network Theory” on popular online marketplaces.



Find "Combinatorial Network Theory" in Wikipdedia