Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Strongly regular graph

Related lectures (28)

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

Explores Laplacian matrices of graphs, graph-digraph association, and physical system examples.

Explores consensus in networked control systems through graph weight design and matrix properties.

Explores optimal binary search trees to minimize expected search cost and discusses graphs representation using adjacency matrices and lists.

Covers the concept of adjacency matrix and adjacency lists for representing networks.

Explores consensus algorithms in digraphs, focusing on scenarios where the digraph is not strongly connected.

Explores link-based ranking through PageRank and HITS algorithms, covering practical examples and challenges in web search and ranking methods.

Explores DFS, Topological Sort, SCC in graphs, and introduces Flow Networks with practical examples.

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

Explores the Laplacian matrix, time-varying consensus theorems, and balanced graphs in networked control systems.

Explores the Laplacian matrix and consensus in networked control systems.

Covers topics like DFS output, edge classification, acyclic graphs, correctness, time analysis, SCCs, and the Topological Sort algorithm.

Explores the conversion of regular expressions to automata for efficient character classification.

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Explores the increment theorem and derivatives in calculus, focusing on polygonal valleys and curve traces.

Discusses finding d-regular graphs with specific eigenvalue properties and the existence of Ramasugan sequences for d-opt prime numbers.

Covers indexing techniques, distributed retrieval algorithms, and challenges in large-scale web indexing.

Explores adjacency lists, locality, similarity, and efficient representation in link indexing.

Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.

Explores link-based ranking and graph mining techniques for efficient web graph analysis.