Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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)
image text in transcribed

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Logic In Databases International Workshop Lid 96 San Miniato Italy July 1 2 1996 Proceedings Lncs 1154

Authors: Dino Pedreschi ,Carlo Zaniolo

1st Edition

3540618147, 978-3540618140

More Books

Students also viewed these Databases questions

Question

3.What are the Importance / Role of Bank in Business?

Answered: 1 week ago