(a) If A is the adjacency matrix of a graph G, show that A is irreducible if and only if
Chapter 4, Problem 4.6.36(choose chapter or problem)
(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?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer