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:

    “People stay
    Next to the edges of fields, hoping that out of nothing
    Something will come, and it does, but what?”
    —John Ashbery (b. 1927)