8.5 Problems
Problem 1. Let G = (V,E) be a directed graph and let u,v ∈V be two of its nodes. Show that if there exists a walk from u to v, then there exists a walk without repeated edges and repeated vertices.
Problem 2. Let G = (V,E) be a strongly connected directed graph. Show that jEj ≥jV j, where jSj denotes the number of elements in the set S. (In other words, show that in order to be strongly connected, G must have at least as many edges as nodes.)
Problem 3. Let A ∈ℝn×n be an irreducible matrix. Is A2 also reducible? (If yes, prove it. If no, show a counterexample.)
Problem 4. Let A ∈ℝ4×4 be the matrix defined by
Find the permutation matrix P that transforms A to a Frobenius normal form!
Join our community on Discord
Read this book alongside other users, Machine Learning experts, and the author himself. Ask questions, provide solutions to other readers, chat with the author via Ask Me Anything sessions, and much more. Scan...