Home /
Expert Answers /
Computer Science /
discrete-math-a-simple-directed-graph-with-vertices-v1-v2-v3-v4-v5-v6-v7-has-ad-pa592
(Solved): discrete math A simple directed graph with vertices v1,v2,v3,v4,v5,v6,v7 has ad ...
discrete math
A simple directed graph with vertices has adjacency matrix 1. What is the order of the graph? order 2. How many edges does the graph have? answer 3.What is the in-degree of vertex ? in-degree 4. What is the out-degree of vertex ? out-degree 5. What is the in-degres of vertex ? in-degree 6. What is the out-degree of vertex ? out-degree
Expert Answer
1. The order of the graph is the number of vertices in the graph. From the adjacency matrix, we can see that the graph has 7 vertices labeled v1, v2, v3, v4, v5, v6, v7. Therefore, the order of the graph is 7.2. To list the edges, we can look at the positions of the nonzero entries in the adjacency matrix. If the entry in row i and column j is nonzero, then there is a directed edge from vertex i to vertex j. Let's list the edges:v1, v2)(v1, v3)(v1, v5)