Question 6 (1 point) An adjacency matrix for an undirected graph is always symmetric. 1) True 2) False Save Question 7 (1 point) A random undirected graph has 9 vertices. An unordered cycle is a connection within the graph that connects a number of vertices. For example an unordered 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 a total of 9 you can use the Combination Formula C(nr)n!(n-r)! 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 is 50%-what is the expected number of unordered cycles? 1) o 2) 3.5 3) 4.375 4) 8.175 5) 9.5 6) 10.5 Save