Friday
October 24, 2014

Homework Help: heelp math

Posted by lin on Monday, July 8, 2013 at 9:54am.

A graph is constructed iteratively according to the following algorithm. The graph starts as a single vertex. With probability p, the graph stops here. Otherwise, 3 new
vertices are constructed and joined to this vertex. If we have a graph with more than one vertex, for each vertex created at the previous stage, 3 new vertices are construed and joined to it with probability 1−p. We repeat this
process until no new vertices are added. When the expected number of vertices in this graph is 100, the value
of p can be expressed as a/b
where
a and
b are coprime
positive integers. What is the value of a+b

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

College Algebra - 1.Answer the following for the given quadratic function. f(x...
Math - Prove that a simple graph with n >_ 2 vertices must have atleast two ...
Math - Prove that a simple graph with n >_ 2 vertices must have atleast two ...
AlgebraB-2 - 1. What are the coordinates of the vertex of the graph? Is it a ...
college algebra - Graph the following function using transformations.Be sure ...
college algebra - Question 638522: Graph the following function using ...
Algebra II - Does the graph of y = x 3x2 + 5 have a maximum or minimum? What ...
Discrete Mathematics - Using Fleury's Algorithm in the graph to the bottom left...
Discrete Mathematics - Using Fleury's Algorithm in the graph to the bottom left...
calculus - Given the graph of f(x) find the graph of 2 f( -3x - 2) - 4 Is this ...

Search
Members