Graph Theory: Connectivity and Properties

In course

Et ipsum nisi amet proident fugiat in minim. Ea sint officia qui excepteur qui minim magna magna et ex cillum enim. Deserunt consectetur sint anim aliqua qui amet amet nulla id. Ipsum est velit non consequat sint enim officia quis incididunt aliquip incididunt. Est sint consectetur commodo velit culpa ipsum. Commodo pariatur Lorem laborum officia exercitation et qui adipisicing aute.

Description

This lecture covers the properties of undirected and directed graphs, including basic definitions, neighbors of a node, subgraphs, connectivity, paths, cycles, trees, and digraphs. It explains the concepts of connectivity, completeness, sources, sinks, directed trees, weak/strong connectivity, global reachable nodes, and directed spanning trees. The instructor emphasizes the importance of graph theory in modeling control network topology and discusses open problems related to graph connectivity and achieving consensus.

Instructor

consectetur occaecat velit

Aliqua sunt nostrud esse nisi adipisicing occaecat quis laborum ex irure non anim duis. Est cillum do ad laborum do officia ad. Irure dolor sit irure enim sint ad veniam irure. Ullamco ullamco aute esse nisi eiusmod aliqua officia sunt enim deserunt.

Official source

https://mediaspace.epfl.ch/media/0_8v1ker8f

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (38)