Purchase Solution

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

Not what you're looking for?

Ask Custom Question

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.

Attachments
Purchase this Solution
Solution Summary

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

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 provided by:
Georgia Martin, PhD
Education
  • AB, Hood College
  • PhD, The Catholic University of America
  • PhD, The University of Maryland at College Park
Recent Feedback
  • "Thanks for your assistance. "
  • "Thank you. I understand now."
  • "Super - Thank You"
  • "Very clear. I appreciate your help. Thank you."
  • "Great. thank you so much!"
Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Probability Quiz

Some questions on probability

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

View More Free Quizzes
Related BrainMass Solutions

  • Graphs : Chromatic Number

    Thus, for example, X(C_(2k))=2 and X(C_(2k+1))=3 Chromatic number: The chromatic number of a graph is the minimum number of colours required to colour it.

  • Graph Theory and Parse Tree

    [Cf. number of nodes of a strictly binary tree with n nodes]. Maximum depth of parse tree = n (log2 n) + 1. This solution offers to-the-point answers to some assorted questions on graph theory and parse tree.

  • Prove that every regular tournament is strong.

    Since all the vertices in D have the same indegrees and outdegrees, we must have k=n-k-1 then we get 2k=n-1. So n=2k+1 is an odd number. (2) From (1), we know, if a graph is a regular tournament, it must have odd number of vertices.

  • Hamiltonian proofs

    ->vm->v1, where m=2^n since the number of vertices in Qn is 2^n. Now in Q(n+1), we know each vk in Qn can be naturally imbeded in Q(n+1) as 0vk.

  • graph theory

    ., Ck (k >= 2), with the number of vertices in component Ci being, say, mi (i = 1, 2, ..., k). Since G - {v} has all the vertices of G except for v, m1 + m2 + ... + mk = n - 1.

  • Fully connected graphs

    For a fully connected graph, every vertex has an edge to every other vertex. DIRAC'S Theorem: if G is a simple graph with n vertices with n ≥ 3 such that the degree of every vertex in G is at least n/2 then G has a Hamilton circuit.

  • Relations and Graph Theory.

    a) Is (2, 4)  S? Is (4, 2)  S? Is (2, 2) S? Is (-2) S (-8). b) Find the set of all elements u with the property that (2, u)  S. c) Find the set of all elements v with the property that (1, v)  S. 5.

  • Trees and Graphs : Outerplanar Graphs

    Use a result you mentioned below in (*), we know that , where m is the number of edges and n is the number of vertices of an outerplanar graph G.

  • Graphs and Vector Calculus

    For n = 1, the statement is vacuous; for n = 2 it is trivial; and for n = 3 it is obvious. Now let n > 3 be arbitrary. We assume that no matter how the edges of Kn have been colored red or blue, one color component is connected.

View More Related Solutions