Question 1 (1 point) When repesenting a graph as an adjacency list, space is sav

Question

Question 1 (1 point) When repesenting a graph as an adjacency list, space is saved compared to representation as an adjacency matrix. 1) True 2) False Save Question 2 (1 point) The following are the degrees of each vertex in a simple graph in decreasing order There are no loops). Is this graph possible (True Yes, False-No)? 6, 6, 6, 6, 3, 3, 2,2 1) True 2) False Save Question 3 (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 the total you can use the Combination Formula C(n,r) n!/r(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 100% (all vetices connected)-what is the expected number of unordered cycles of length 3? 4 2) 10 3) 20 4) 35 5) 56

Explanation / Answer

If you post more than 1 question, as per chegg guidelines I have to solve only first question.

Ques 1. True

In adjacency matrix, the size of matrix is V x V, where V is the number of vertices.

But in adjacency list, we add only the nodes with which there is an edge. So, no extra edge is wsted as in adjacency matrix.

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.