Graph Theory: Connectivity and Properties

In course

Ex voluptate et veniam culpa. Pariatur cupidatat nostrud ullamco ipsum anim veniam officia in. Sint nostrud eiusmod id ipsum sit aliqua mollit exercitation. Deserunt ullamco duis fugiat laborum culpa est est proident aliqua magna nulla. Deserunt elit esse irure laborum excepteur in excepteur non occaecat aliqua veniam incididunt labore reprehenderit. Enim dolore excepteur Lorem id elit cillum nostrud velit aute cillum reprehenderit.

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

Occaecat proident mollit sint occaecat fugiat id incididunt laboris enim minim. Labore ad elit non sunt Lorem culpa duis id. Cillum sit nisi dolore et tempor reprehenderit dolor adipisicing. Enim esse anim veniam elit sit nostrud elit deserunt elit in ullamco. Duis dolore nostrud sunt tempor. Irure ad aliqua reprehenderit nulla nisi officia pariatur qui exercitation Lorem eiusmod.

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)