Dominating Sets and Domination Number of Graphs | Graph Theory
A vertex is said to dominate itself and its neighbors. Then, a dominating set of a graph G is a vertex subset S of G such that every vertex in G is dominated by some vertex in S. This means every vertex in G-S is adjacent to some vertex in S. A dominating set of minimum cardinality is a mi
From playlist Graph Theory
What is a Complete Graph? | Graph Theory
What is a complete graph? That is the subject of today's lesson! A complete graph can be thought of as a graph that has an edge everywhere there can be an edge. This means that a graph is complete if and only if every pair of distinct vertices in the graph is joined by an edge. So if, in a
From playlist Graph Theory
Vertex Covering Number of Complete Graphs | Graph Theory Exercises
We discuss and prove the vertex covering number of a complete graph Kn is n-1. That is, the minimum number of vertices needed to cover a complete graph is one less than its number of vertices. This is because, put simply, if we are missing at least 2 vertices in our attempted vertex cover,
From playlist Graph Theory Exercises
Matchings, Perfect Matchings, Maximum Matchings, and More! | Independent Edge Sets, Graph Theory
What are matchings, perfect matchings, complete matchings, maximal matchings, maximum matchings, and independent edge sets in graph theory? We'll be answering that great number of questions in today's graph theory video lesson! A matching in a graph is a set of edges with no common end-ve
From playlist Graph Theory
Maximum and Maximal Cliques | Graph Theory, Clique Number
What are maximum cliques and maximal cliques in graph theory? We'll be defining both terms in today's video graph theory lesson, as well as going over an example of finding maximal and maximum cliques in a graph. These two terms can be a little confusing, so let's dig in and clarify our un
From playlist Graph Theory
Complement of Independent Set is Vertex Cover | Graph Theory
We prove the complement of an independent vertex set is a vertex cover. This makes for an easy direct proof once we recall our definitions. An independent vertex set is a set of vertices, no two of which are adjacent. A vertex cover is a set of vertices such that every edge has at least on
From playlist Graph Theory
What are the Maximum and Maximal Cliques of this Graph? | Graph Theory
How do we find the maximum and maximal cliques of a graph? We'll go over an example in today's graph theory lesson of doing just that! To use these elementary methods, we just need to remember our definitions. A clique of a graph G is a complete subgraph of G. We also call the vertex set
From playlist Graph Theory
Perfect crystals for quantum affine algebras and combinatorics of Young walls
Seok-Jin Kang (Seoul National University). Plenary Lecture from the 1st PRIMA Congress, 2009. Plenary Lecture 12. Abstract: In this talk, we will give a detailed exposition of theory of perfect crystals, which has brought us a lot of significant applications. On the other hand, we will al
From playlist PRIMA2009
The Colorful Connected Subgraph Problem - Richard Karp
A Celebration of Mathematics and Computer Science Celebrating Avi Wigderson's 60th Birthday October 5 - 8, 2016 More videos on http://video.ias.edu
From playlist Mathematics
Empty Graph, Trivial Graph, and the Null Graph | Graph Theory
Whenever we talk about something that is defined by sets, it is important to consider the empty set and how it fits into the definition. In graph theory, empty sets in the definition of a particular graph can bring on three types/categories of graphs. The empty graphs, the trivial graph, a
From playlist Graph Theory
Vertex Covers and Vertex Covering Numbers | Graph Theory
We introduce vertex covers, minimum vertex covers, and vertex covering numbers! We'll see some examples and non-examples of vertex covers, as well as minimum vertex covers and some that aren't minimum. The number of vertices in a minimum vertex cover is called the vertex covering number of
From playlist Graph Theory
AMMI 2022 Course "Geometric Deep Learning" - Seminar 1 (Physics-based GNNs) - Francesco Di Giovanni
Video recording of the course "Geometric Deep Learning" taught in the African Master in Machine Intelligence in July 2022 Seminar 1 - Graph neural networks through the lens of multi-particle dynamics and gradient flows - Francesco Di Giovanni (Twitter) Slides: https://www.dropbox.com/s/
From playlist AMMI Geometric Deep Learning Course - Second Edition (2022)
Dynamical Systems as Feature Representations for Learning from Data - Peter Tino - 6/25/2019
AstroInformatics 2019 Conference: AstroInformatics Methods and Applications http://astroinformatics2019.org/
From playlist AstroInformatics 2019 Conference
The IR-truncated PT −symmetric V = ix3 model and its asymptotic by Uwe Guenther
PROGRAM NON-HERMITIAN PHYSICS - PHHQP XVIII DATE :04 June 2018 to 13 June 2018 VENUE:Ramanujan Lecture Hall, ICTS Bangalore Non-Hermitian Physics-"Pseudo-Hermitian Hamiltonians in Quantum Physics (PHHQP) XVIII" is the 18th meeting in the series that is being held over the years in Qua
From playlist Non-Hermitian Physics - PHHQP XVIII
GraphData: New Developments and Research Applications
GraphData is an extensive curated database of simple graphs and their properties available in Mathematica as a built-in data paclet and in Wolfram|Alpha via natural language queries. GraphData was first introduced in Mathematica Version 6, and the number of graphs, property count, and frac
From playlist Wolfram Technology Conference 2013
Model Theory of Fields with Virtually Free Group Action - Ö. Beyarslan - Workshop 3 - CEB T1 2018
Özlem Beyarslan (Boğaziçi University) / 29.03.2018 Model Theory of Fields with Virtually Free Group Action This is joint work with Piotr Kowalski. A G-field is a field, together with an acion of a group G by field automorphisms. If an axiomatization for the class of existentially closed
From playlist 2018 - T1 - Model Theory, Combinatorics and Valued fields
AQA Decision 1 3.03 Complete Graphs Kn
I introduce the concept of a complete graph and find how many edges there would be for a complete graph with n vertices.
From playlist [OLD SPEC] TEACHING AQA DECISION 1 (D1)