Question
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $1 / 2$. What is the expected number of unordered cycles of length three?A. A $1 / 8$B. 1C. 7D. 8
Step 1
An unordered cycle of length three is a triangle in the graph, consisting of three vertices connected by three edges. Show more…
Show all steps
Your feedback will help us improve your experience
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD