Lectures related to Networks: Structure and Properties

Shortest Path Algorithms: BFS and Dijkstra

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.

Connectivity in Graph Theory

Covers the fundamentals of connectivity in graph theory, including paths, cycles, and spanning trees.

Handling Network Data

Covers handling network data, types of graphs, centrality measures, and properties of real-world networks.

Mathematical Analysis: Functions and Composition

Covers the analysis of functions, composition, and mathematical induction.

Untitled

Cayley Graphs: Properties and Applications

Explores the properties and applications of Cayley graphs in group theory and network analysis.

Tangent to Graph of a Function

Explores finding the equation of the tangent line to a function's graph at a point.

Graph Theory Fundamentals

Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.

Graph and Diagonal

Discusses the graph of a relation and the concept of separation.