This lecture covers the Laplacian flow and consensus on communication networks with a globally reachable node, illustrated through examples. It delves into the analysis of x = -Lx, equilibria, and theorems related to achieving consensus in networked control systems.