Series-parallel networks problem

From Wikipedia, the free encyclopedia

In combinatorial mathematics, the series-parallel networks problem asks for the number of series-parallel networks that can be formed using a given number of edges. The edges can be distinguishable or indistinguishable.

[edit] Indistinguishable edges

When the edges are indistinguishable, we look for the number of topologically different networks on n edges.

[edit] Solution

The idea is to break-down the problem by classifying the networks as essentially series and essentially parallel networks.

  • An essentially series network is a network which can be broken down into two or more subnetworks in series.
  • An essentially parallel network is a network which can be broken down into two or more subnetworks in parallel.

By the duality of networks, it can be proved that the number of essentially series networks is equal to the number of essentially parallel networks. Thus for all n > 1, the number of networks in n edges is twice the number of essentially series networks. For n = 1, the number of networks is 1.

Define

  • an as the number of series-parallel networks on n indistinguishable edges.
  • bn as the number of essentially series networks.

Then

a_n=\left\{\begin{matrix} 1, & \mbox{if }n\mbox{ is 1} \\ 2b_n, & \mbox{otherwise}\end{matrix}\right.

bn can be found out by enumerating the partitions of n.

Consider a partition, {pi} of n:

∑ ipi = n.
i

Consider the essentially series networks whose components correspond to the partition above. That is the number of components with i edges is pi. The number of such networks can be computed as

\prod_{i}{{b_i+p_i-1}\choose{p_i}}.

Hence

b_n=\sum_{p_i}{\prod_{i}{{b_i+p_i-1}\choose{p_i}}}

where the summation is over all partitions, pi of n except for the trivial partition consisting of only n.

This gives a recurrence for computing bn. Now an can be computed as above.

[TODO: Generating function for an and bn are explained in the external links.]

[edit] External links