Series-parallel Networks Problem - Indistinguishable Edges

Indistinguishable Edges

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

Read more about this topic:  Series-parallel Networks Problem

Famous quotes containing the word edges:

    “There are moods in which we court suffering, in the hope that here, at least, we shall find reality, sharp peaks and edges of truth. But it turns out to be scene-painting and counterfeit. The only thing grief has taught me, is to know how shallow it is.”
    —Ralph Waldo Emerson (1803–1882)