Graph families | Strongly regular graphs | Regular graphs | Algebraic graph theory
In graph theory, a strongly regular graph (SRG) is defined as follows. Let G = (V, E) be a regular graph with v vertices and degree k. G is said to be strongly regular if there are also integers λ and μ such that: * Every two adjacent vertices have λ common neighbours. * Every two non-adjacent vertices have μ common neighbours. The complement of an srg(v, k, λ, μ) is also strongly regular. It is a srg(v, v − k − 1, v − 2 − 2k + μ, v − 2k + λ). A strongly regular graph is a distance-regular graph with diameter 2 whenever μ is non-zero. It is a locally linear graph whenever λ = 1. (Wikipedia).
What is a Highly Irregular Graph? | Locally Irregular Graph, Graph Theory
Irregular graphs are a bit tricky to define, because the most intuitive definition leads to nothing of interest. In today's math video lesson, we introduce an alternative definition of irregular graph, with plenty of examples, called a highly irregular graph! These graphs are also sometime
From playlist Graph Theory
What are Regular Graphs? | Graph Theory
What is a regular graph? That is the subject of today's math lesson! A graph is regular if and only if every vertex in the graph has the same degree. If every vertex in a graph has degree r, then we say that graph is "r-regular" or "regular of degree r". If a graph is not regular, as in, i
From playlist Graph Theory
Strongly Connected Directed Graphs | Graph Theory, Digraph Theory
What are strongly connected digraphs? That's what we'll be going over in today's graph theory lesson. We'll recap connectedness, what it means to be weakly connected, and then finish off with the definition of strongly connected! We say a directed graph D is strongly connected if, for eve
From playlist Graph Theory
What are Cubic Graphs? | Graph Theory
What are cubic graphs? We go over this bit of graph theory in today's math lesson! Recall that a regular graph is a graph in which all vertices have the same degree. The degree of a vertex v is the number of edges incident to v, or equivalently the number of vertices adjacent to v. If ever
From playlist Graph Theory
What are Irregular Graphs? (and why they are boring) | Graph Theory
What are irregular graphs? After learning about regular graphs, this is a natural question to ask. Irregular graphs are the opposite of regular graphs, which means that irregular graphs are graphs in which all vertices have distinct degrees. Equivalently, a graph is irregular if and only i
From playlist Graph Theory
Powered by https://www.numerise.com/ Cubic graphs (recognising)
From playlist Important graphs
Weakly Connected Directed Graphs | Digraph Theory
What is a connected digraph? When we start considering directed graphs, we have to rethink our definition of connected. We say that an undirected graph is connected if there exists a path connecting every pair of vertices. However, in a directed graph, we need to be more specific since it
From playlist Graph Theory
Cubic graphs (from a table of values)
Powered by https://www.numerise.com/ Cubic graphs (from a table of values)
From playlist Important graphs
Vanishing Krein Parameters in Finite Geometry, by John Bamberg
CMSA Combinatorics Seminar, 3 June 2020
From playlist CMSA Combinatorics Seminar
Graph Neural Networks, Session 2: Graph Definition
Types of Graphs Common data structures for storing graphs
From playlist Graph Neural Networks (Hands-on)
Stéphane Nonennmacher - From Fractal Weyl Laws to spectral questions on sparse directed graphs
https://indico.math.cnrs.fr/event/3475/attachments/2180/2563/Nonnenmacher_GomaxSlides.pdf
From playlist Google matrix: fundamentals, applications and beyond
Seminar on Applied Geometry and Algebra (SIAM SAGA): Dustin Mixon
Title: Packing Points in Projective Spaces Speaker: Dustin Mixon Date: Tuesday, March 8, 2022 at 11:00am Eastern Abstract: Given a compact metric space, it is natural to ask how to arrange a given number of points so that the minimum distance is maximized. For example, the setting of the
From playlist Seminar on Applied Geometry and Algebra (SIAM SAGA)
Non-amenable groups admitting no sofic approximation by expander graphs - Gabor Kun
Stability and Testability Topic: Non-amenable groups admitting no sofic approximation by expander graphs Speaker: Gabor Kun Affiliation: Alfréd Rényi Institute of Mathematics Date: February 10, 2021 For more video please visit http://video.ias.edu
From playlist Stability and Testability
Semisimple $\mathbb{Q}$-algebras in algebraic combinatorics by Allen Herman
PROGRAM GROUP ALGEBRAS, REPRESENTATIONS AND COMPUTATION ORGANIZERS: Gurmeet Kaur Bakshi, Manoj Kumar and Pooja Singla DATE: 14 October 2019 to 23 October 2019 VENUE: Ramanujan Lecture Hall, ICTS Bangalore Determining explicit algebraic structures of semisimple group algebras is a fund
From playlist Group Algebras, Representations And Computation
Twisted Patterson-Sullivan Measure and Applications to Growth Problems (Lecture-3) by Remi Coulon
PROGRAM: PROBABILISTIC METHODS IN NEGATIVE CURVATURE (ONLINE) ORGANIZERS: Riddhipratim Basu (ICTS - TIFR, Bengaluru), Anish Ghosh (TIFR, Mumbai) and Mahan M J (TIFR, Mumbai) DATE & TIME: 01 March 2021 to 12 March 2021 VENUE: Online Due to the ongoing COVID pandemic, the meeting will
From playlist Probabilistic Methods in Negative Curvature (Online)
This is Lecture 17 of the COMP300E (Programming Challenges) course taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Hong Kong University of Science and Technology in 2009. The lecture slides are available at: http://www.algorithm.cs.sunysb.edu/programmingchallenges
From playlist COMP300E - Programming Challenges - 2009 HKUST
Marian Mrozek (8/30/21): Combinatorial vs. Classical Dynamics: Recurrence
The study of combinatorial dynamical systems goes back to the seminal 1998 papers by Robin Forman. The main motivation to study combinatorial dynamics comes from data science. Combinatorial dynamics also provides very concise models of dynamical phenomena. Moreover, some topological invari
From playlist Beyond TDA - Persistent functions and its applications in data sciences, 2021
Xavier Ros-Oton: Regularity of free boundaries in obstacle problems, Lecture II
Free boundary problems are those described by PDE that exhibit a priori unknown (free) interfaces or boundaries. Such type of problems appear in Physics, Geometry, Probability, Biology, or Finance, and the study of solutions and free boundaries uses methods from PDE, Calculus of Variations
From playlist Hausdorff School: Trending Tools
Limits of permutation sequences - Yoshi Kohayakawa
Conference on Graphs and Analysis Yoshi Kohayakawa June 5, 2012 More videos on http://video.ias.edu
From playlist Mathematics
Straight line graphs (perpendicular) 2
Powered by https://www.numerise.com/ Straight line graphs (perpendicular) 2
From playlist Linear sequences & straight lines