Networked Control Systems: Convergence Rate and Digraphs

Related lectures (27)

Page 1 of 3

Distinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Covers the concept of networks, graphs, subgraphs, directed graphs, and indegree in network theory.

Covers bipartite and n-partite graphs, including complete graph definitions and examples.

Covers edge elimination and orientation in graphs, including first order tests and logical orientation.

Explores handling network data, including types of graphs, real-world network properties, and node importance measurement.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Explores automorphism groups in trees and graphs, focusing on ends and types of automorphisms.

Explores automorphisms of graphs, focusing on automorphism groups, Cayley-Abels graphs, and quasi-isometry.

Explores automorphism groups of trees and graphs, including actions on trees and group homomorphisms.