Article contents
The Strongly Connected Components of 1-in, 1-out
Published online by Cambridge University Press: 12 September 2008
Abstract
We consider a random digraph Din, out(n) on vertices 1, …, n, where, for each vertex v, we choose at random one of the n possible arcs with head v and one of the n possible arcs with tail v. We show that the expected size of the largest component of Din, out is .
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1992
References
- 1
- Cited by