Question: A directed graph G has 5 vertices, numbered 1 through 5 . The 5 5 matrix A is the adjacency matrix for G . The

A directed graph G has 5 vertices, numbered 1 through 5. The 55 matrix A is the adjacency matrix for G. The matrices A2 and A3 are given below.
A2=([0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1],[1,0,1,0,0],[0,0,1,0,1]),A3=([0,0,0,1,0],[0,0,0,0,1],[1,0,1,0,0],[0,1,0,1,0],[0,0,1,0,1])
Which edge is not in the transitive closure of G?
(1,3)
(2,4)
(4,5)
(5,5)
 A directed graph G has 5 vertices, numbered 1 through 5.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!