In the mathematical field of graph theory, a self-complementary graph is a graph which is isomorphic to its complement. The simplest non-trivial self-complementary graphs are the 4-vertex path graph and the 5-vertex cycle graph. There is no known characterization of self-complementary graphs. (Wikipedia).
Graph Theory: 48. Complement of a Graph
In this video I define the complement of a graph and what makes a graph self-complementary. I show some examples, for orders 4 and 5 and discuss a necessary condition on the order of a graph for it to be self-complementary. Finally I give a brief description of a constructive algorithm f
From playlist Graph Theory part-8
What is the Complement of a Graph? | Graph Theory, Graph Complements, Self Complementary Graphs
What is the complement of a graph? What are self complementary graphs? We'll be answering these questions in today's video graph theory lesson! If G is a graph, the complement of G has the same vertex set but the "opposite" edge set. That means two vertices are adjacent in G Complement if
From playlist Graph Theory
Overview of Loops in Graph Theory | Graph Loop, Multigraphs, Pseudographs
What are loops in graph theory? Sometimes called self loops, a loop in a graph is an edge that connects a vertex to itself. These are not allowed in what are often called "simple graphs", which are the graphs we usually study when we begin studying graph theory. In simple graphs, loop ed
From playlist Graph Theory
What are Connected Graphs? | Graph Theory
What is a connected graph in graph theory? That is the subject of today's math lesson! A connected graph is a graph in which every pair of vertices is connected, which means there exists a path in the graph with those vertices as endpoints. We can think of it this way: if, by traveling acr
From playlist Graph Theory
Powered by https://www.numerise.com/ Reciprocal graphs 2
From playlist Important graphs
Parallel Edges in Multigraphs and Digraphs | Graph Theory, Multiple Edges, Multisets
What are parallel edges, also called multiple edges or multi-edges, in graph theory? We'll introduce parallel edges in the context of undirected multi-graphs and in directed graphs in today's video graph theory lesson! Lesson on directed graphs: https://www.youtube.com/watch?v=mXoiHgH4mE
From playlist Graph Theory
Graph Theory: 10. Isomorphic and Non-Isomorphic Graphs
Here I provide two examples of determining when two graphs are isomorphic. If they are isomorphic, I give an isomorphism; if they are not, I describe a property that I show occurs in only one of the two graphs. Here is a related video in which I show how to check for whether these examp
From playlist Graph Theory part-2
Reciprocal Graphs | Graphs | Maths | FuseSchool
Reciprocal functions are actually extremely important. Isaac Newton deduced that the forces needed to hold planets in orbits is a reciprocal relationship with the squares of their distances. Radioactive isotopes decay reciprocally, and trees lose their leaves reciprocally. The graph appe
From playlist MATHS
Onset of natural selection and "reversal of the Second Law" by Alexei Tkachenko30
PROGRAM ENTROPY, INFORMATION AND ORDER IN SOFT MATTER ORGANIZERS: Bulbul Chakraborty, Pinaki Chaudhuri, Chandan Dasgupta, Marjolein Dijkstra, Smarajit Karmakar, Vijaykumar Krishnamurthy, Jorge Kurchan, Madan Rao, Srikanth Sastry and Francesco Sciortino DATE: 27 August 2018 to 02 Novemb
From playlist Entropy, Information and Order in Soft Matter
Sophie Spirkl - The Erdős-Hajnal conjecture for the five-cycle (CMSA Combinatorics seminar)
Sophie Spirkl (University of Waterloo) presents "The Erdős-Hajnal conjecture for the five-cycle", 3 March 2021 (CMSA Combinatorics Seminar).
From playlist CMSA Combinatorics Seminar
Christian Bär - Boundary value problems for Dirac operators
This introduction to boundary value problems for Dirac operators will not focus on analytic technicalities but rather provide a working knowledge to anyone who wants to apply the theory, i.e. in the study of positive scalar curvature. We will systematically study "elliptic boundary conditi
From playlist Not Only Scalar Curvature Seminar
Introduction to SNA. Lecture 2. Descriptive Network Analysis
Lecture slides: https://drive.google.com/file/d/0B7-pBlaW03HaMTk5QVNwVmZrbGc/view?usp=sharing Basic graph theory. Node degree distribution. Graph diameter and average path length. Clustering coefficient. Real world examples
From playlist Introduction to SNA
Towards Life in a Jar by Zorana Zeravcic
Kaapi with Kuriosity Towards Life in a Jar by Zorana Zeravcic (ESPCI Paris, France) 4pm to 6pm Sunday, 22 April 2018 Jawaharlal Nehru Planetarium, Bengaluru Living organisms have amazing capabilities: they move and react, eat and digest, reproduce and heal, sense and communicate, and al
From playlist Kaapi With Kuriosity (A Monthly Public Lecture Series)
Graphing Secant & Cosecant w/ t-table
I show the reciprocal relationship between the Cosine and Secant graph and Sine Cosecant graph. This video includes two examples of graphing these inverse functions. Note the reciprocal identities CSC(theta)=1/SIN(theta) and SEC(theta)=1/COS(theta) as I work through these examples. If y
From playlist PreCalculus
Conformal removability of non-simple Schramm-Loewner evolutions - Konstantinos Kavvadias
Probability Seminar Topic: Conformal removability of non-simple Schramm-Loewner evolutions Speaker: Konstantinos Kavvadias Affiliation: Tata Institute of Fundamental Research Date: April 07, 2023 We consider the Schramm-Loewner evolution (SLE_{kappa}) for kappa in (4,8), which is the re
From playlist Mathematics
Jeff Erickson - Lecture 5 - Two-dimensional computational topology - 22/06/18
School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects (http://geomschool2018.univ-mlv.fr/) Jeff Erickson (University of Illinois at Urbana-Champaign, USA) Two-dimensional computational topology - Lecture 4 Abstract: This series of lectures will describe recent
From playlist Jeff Erickson - School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects
1B. Intro 1: Computational Side of Computational Biology. Statistics; Perl, Mathematica
MIT HST.508 Genomics and Computational Biology, Fall 2002 Instructor: George Church View the complete course: https://ocw.mit.edu/courses/hst-508-genomics-and-computational-biology-fall-2002/ YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP61gaHWysmlYNeGsuUI8y5GV We're
From playlist HST.508 Genomics and Computational Biology, Fall 2002
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms