Abstract
We consider an unordered graph where there is one arc emanating from each node. We suppose that the arc that emanates from i will go to j with probability Pj . The probability that the resultant graph is connected and a recursive formula for the distribution of the number of components it possesses are derived.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
