Question: Question 6(1 point) A random undirected graph has 8 wertices. An unordered cycle is a connection within the graph that connects a number of vertices.

Question 6(1 point) A random undirected graph has 8 wertices. An unordered cycle is a connection within the graph that connects a number of vertices. For example an unondered cycle of 3 would be a triangle within the graph of 3 connected vertices. To find the total number of possible unordered cycles of 3 vertices from the total you can use the Combination Formula Cin,r-ne/rn-re which is total number of possible combinations of r objects from a set of n objects. If the probability of an edge between any two vertices ls 100% tall vetices connected-what is the expected number of unordered cycles of length 3? 1) 4 2 10 03)20 4) 35 5) 56 6) 84 Question 7 (1 point) For an undirected graph the number of vertices wlth an odd degree is always an even number 1) True 2) False
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
