Explore BrainMass

# Number of graphs with vertex set {1, 2, 3, ..., n}

Not what you're looking for? Search our solutions OR ask your own Custom question.

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

The problem is to let V = {1, 2, 3, ..., n}, and to determine the number of different graphs that can be formed with V as vertex set.

See attached file for full problem description.

https://brainmass.com/math/graphs-and-functions/number-of-graphs-with-vertex-set-1-2-3-n-28047

#### Solution Preview

Two graphs G1, G2 with the same vertex set are different if and only if there is at least one edge in G1 that is not in G2, or at least one edge in G2 that is not in G1, or both.

Every edge of a graph is naturally associated with some unordered pair of vertices (the unordered pair of vertices that are connected by that edge), and no two edges are associated with the same unordered pair of vertices, since there can be at most one edge connecting a given ...

#### Solution Summary

The solution is a step-by-step derivation of the number of graphs with vertices 1, 2, 3, ..., n.

\$2.49