Random Graphs

This quiz is designed to assess your understanding of Random Graphs, a branch of Graph Theory that deals with the study of graphs with random properties.

14 Questions Published

Questions

Question 1 Multiple Choice (Single Answer)

What is the expected number of edges in a random graph with (n) vertices and (p) probability of an edge between any two vertices?

  1. \(np\)
  2. \(n(n-1)p\)
  3. \(n(n-1)p/2\)
  4. \(n(n+1)p/2\)
Question 2 Multiple Choice (Single Answer)

What is the probability that a random graph with (n) vertices and (p) probability of an edge between any two vertices is connected?

  1. \((1-p)^{n-1}\)
  2. \(1-(1-p)^{n-1}\)
  3. \(p^{n-1}\)
  4. \(1-p^{n-1}\)
Question 3 Multiple Choice (Single Answer)

What is the expected number of components in a random graph with (n) vertices and (p) probability of an edge between any two vertices?

  1. \(n-1\)
  2. \(n\)
  3. \(n+1\)
  4. \(n(n-1)p\)
Question 4 Multiple Choice (Single Answer)

What is the probability that a random graph with (n) vertices and (p) probability of an edge between any two vertices is a tree?

  1. \(p^{n-2}\)
  2. \(1-p^{n-2}\)
  3. \((1-p)^{n-2}\)
  4. \(1-(1-p)^{n-2}\)
Question 5 Multiple Choice (Single Answer)

What is the expected number of cycles of length (k) in a random graph with (n) vertices and (p) probability of an edge between any two vertices?

  1. \(n^{k-1}p^{k}\)
  2. \(n^{k}p^{k}\)
  3. \(n^{k+1}p^{k}\)
  4. \(n^{k-2}p^{k}\)
Question 6 Multiple Choice (Single Answer)

What is the probability that a random graph with (n) vertices and (p) probability of an edge between any two vertices is Eulerian?

  1. \((1-p)^{n-1}\)
  2. \(1-(1-p)^{n-1}\)
  3. \(p^{n-1}\)
  4. \(1-p^{n-1}\)
Question 7 Multiple Choice (Single Answer)

What is the expected number of Hamiltonian cycles in a random graph with (n) vertices and (p) probability of an edge between any two vertices?

  1. \(n!p^{n}\)
  2. \(n!p^{n-1}\)
  3. \(n!p^{n-2}\)
  4. \(n!p^{n+1}\)
Question 8 Multiple Choice (Single Answer)

What is the probability that a random graph with (n) vertices and (p) probability of an edge between any two vertices is planar?

  1. \((1-p)^{n-3}\)
  2. \(1-(1-p)^{n-3}\)
  3. \(p^{n-3}\)
  4. \(1-p^{n-3}\)
Question 9 Multiple Choice (Single Answer)

What is the expected number of matchings in a random graph with (n) vertices and (p) probability of an edge between any two vertices?

  1. \(n!p^{n/2}\)
  2. \(n!p^{n-1}\)
  3. \(n!p^{n-2}\)
  4. \(n!p^{n+1}\)
Question 10 Multiple Choice (Single Answer)

What is the probability that a random graph with (n) vertices and (p) probability of an edge between any two vertices is perfect?

  1. \((1-p)^{n-1}\)
  2. \(1-(1-p)^{n-1}\)
  3. \(p^{n-1}\)
  4. \(1-p^{n-1}\)
Question 11 Multiple Choice (Single Answer)

What is the expected number of cliques of size (k) in a random graph with (n) vertices and (p) probability of an edge between any two vertices?

  1. \(n^{k}p^{k}\)
  2. \(n^{k-1}p^{k}\)
  3. \(n^{k+1}p^{k}\)
  4. \(n^{k-2}p^{k}\)
Question 12 Multiple Choice (Single Answer)

What is the probability that a random graph with (n) vertices and (p) probability of an edge between any two vertices is strongly connected?

  1. \((1-p)^{n-1}\)
  2. \(1-(1-p)^{n-1}\)
  3. \(p^{n-1}\)
  4. \(1-p^{n-1}\)
Question 13 Multiple Choice (Single Answer)

What is the expected number of independent sets of size (k) in a random graph with (n) vertices and (p) probability of an edge between any two vertices?

  1. \(n^{k}p^{k}\)
  2. \(n^{k-1}p^{k}\)
  3. \(n^{k+1}p^{k}\)
  4. \(n^{k-2}p^{k}\)
Question 14 Multiple Choice (Single Answer)

What is the probability that a random graph with (n) vertices and (p) probability of an edge between any two vertices is Hamiltonian?

  1. \((1-p)^{n-1}\)
  2. \(1-(1-p)^{n-1}\)
  3. \(p^{n-1}\)
  4. \(1-p^{n-1}\)