(a) If A is the adjacency matrix of a graph G, show that A is irreducible if...

Question:

(a) If A is the adjacency matrix of a graph G, show that A is irreducible if and only if G is connected. (A graph is connected if there is a path between every pair of vertices.)

(b) Which of the graphs in Section 4.0 have an irreducible adjacency matrix? Which have a primitive adjacency matrix?

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: