This lecture covers the concept of primitive matrices and their relation to strongly connected digraphs. It discusses the Perron-Frobenius theorem and the spectral properties of non-negative matrices, emphasizing the existence of dominant eigenvalues and eigenvectors. The lecture also explores examples of periodic and aperiodic digraphs, highlighting the importance of irreducibility and primitivity in networked control systems.