a). Consider the following directed graph D: 1. Deduce the indegree and outdegree of each of...

 

Transcribed Image Text:

a). Consider the following directed graph D: 1. Deduce the indegree and outdegree of each of the vertices 1, 2, 3, 4, 5, 6 and, hence, state whether D has any sources or sinks? [7 Marks] Find the (adjacency) matrix M of D. [6 Marks] II. II. Determine whether D is strictly unilaterally connected, strongly connected or neither. Justify your answer. [2 Marks] b). Suppose that in a group of 5 people: A, B, C, D, and E, the following pairs of people are acquainted with each other. A and C; A and D; B and C; C and D; C and E [4 Marks] Draw a graph G to represent this situation. II. List the vertex set, and the edge set, using set notation. In other words, show sets V I. [5 Marks] [5 Marks] [6 Marks] and E for the vertices and edges, respectively, in G = {V, E}. II. Deduce the degree(s) of each vertex. IV. Draw an adjacency matrix for G. a). Consider the following directed graph D: 1. Deduce the indegree and outdegree of each of the vertices 1, 2, 3, 4, 5, 6 and, hence, state whether D has any sources or sinks? [7 Marks] Find the (adjacency) matrix M of D. [6 Marks] II. II. Determine whether D is strictly unilaterally connected, strongly connected or neither. Justify your answer. [2 Marks] b). Suppose that in a group of 5 people: A, B, C, D, and E, the following pairs of people are acquainted with each other. A and C; A and D; B and C; C and D; C and E [4 Marks] Draw a graph G to represent this situation. II. List the vertex set, and the edge set, using set notation. In other words, show sets V I. [5 Marks] [5 Marks] [6 Marks] and E for the vertices and edges, respectively, in G = {V, E}. II. Deduce the degree(s) of each vertex. IV. Draw an adjacency matrix for G.

Answer rating: 100% (QA)

Solution fry the Jiven Problem riven that 1 hdyree no of edges Conting ... View the full answer