Graph families | Algebraic graph theory
In the mathematical field of graph theory, an edge-transitive graph is a graph G such that, given any two edges e1 and e2 of G, there is an automorphism of G that maps e1 to e2. In other words, a graph is edge-transitive if its automorphism group acts transitively on its edges. (Wikipedia).
What is a Graph? | Graph Theory
What is a graph? A graph theory graph, in particular, is the subject of discussion today. In graph theory, a graph is an ordered pair consisting of a vertex set, then an edge set. Graphs are often represented as diagrams, with dots representing vertices, and lines representing edges. Each
From playlist Graph Theory
What is a Path Graph? | Graph Theory
What is a path graph? We have previously discussed paths as being ways of moving through graphs without repeating vertices or edges, but today we can also talk about paths as being graphs themselves, and that is the topic of today's math lesson! A path graph is a graph whose vertices can
From playlist Graph Theory
Transitive Tournaments (Directed Graphs) | Graph Theory
We introduce transitive tournaments and look at some neat properties they possess! Recall a tournament graph is a directed graph with exactly one arc between each pair of vertices. In other words, it is an orientation of a complete graph. #GraphTheory We say a tournament T is transitive i
From playlist Graph Theory
Graph Theory: 20. Edge Weighted Shortest Path Problem
This video explains the problem known as the edge-weighted shortest path problem. The next two videos look at an algorithm which provides a solution to the problem. --An introduction to Graph Theory by Dr. Sarada Herke. For quick videos about Math tips and useful facts, check out my othe
From playlist Graph Theory part-4
Edge Cuts and Edge Connectivity | Graph Theory
Edge cuts, minimum edge cuts, minimal edge cuts, and edge connectivity are all introduced in today's graph theory lesson! Edge cuts are similar to vertex cuts but, of course, with edges! An edge cut of a nontrivial graph G is a set, X, of edges of G, such that G-X is disconnected. The car
From playlist Graph Theory
Reflexive, Symmetric, and Transitive Relations on a Set
A relation from a set A to itself can be though of as a directed graph. We look at three types of such relations: reflexive, symmetric, and transitive. A relation is reflexive if every element relates to itself, that is has a little look from itself to itself. A relation is symmetric if
From playlist Discrete Math (Full Course: Sets, Logic, Proofs, Probability, Graph Theory, etc)
Introduction to graph theory. Directed and undirected graph
From playlist Graph Theory
What are Bridges of Graphs? | Graph Theory, Edge Deletion
What are bridges of graphs? Bridges are the edge version of cut vertices. If e is an edge of a graph G and deleting e disconnected the component it belongs to, then e is an edge. So, for a connected graph G, an edge e is a bridge of G if G-e is disconnected. For a disconnected graph G, e
From playlist Graph Theory
Breakdown of the basic components of graphs in graph theory
From playlist Graph Theory
Graph Theory: 29. Lovasz Conjecture on Hamilton Paths
Lovasz has conjectured that every finite connected vertex-transitive graph has a Hamilton path. In this video I explain what vertex-transitive graphs are and provide some examples and non-examples. I begin by defining an automorphism of a graph and similar vertices. An introduction to Gr
From playlist Graph Theory part-6
Colouring Tournaments - Paul Seymour
Paul Seymour Princeton University December 13, 2010 A ``tournament'' is a digraph obtained from a complete graph by directing its edges, and ``colouring'' a tournament means partitioning its vertex set into acyclic subsets (``acyclic'' means the subdigraph induced on the subset has no dire
From playlist Mathematics
Network Science 2021 @ HSE http://www.leonidzhukov.net/hse/2021/networks/
From playlist Network Science, 2021
Jon Pakianathan (5/7/19): On a canonical construction of tessellated surfaces from finite groups
Title: On a canonical construction of tessellated surfaces from finite groups Abstract: In this talk we will discuss an elementary construction that associates to the non-commutative part of a finite group’s multiplication table, a finite collection of closed, connected, oriented surfaces
From playlist AATRN 2019
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
Regular permutation groups and Cayley graphs
Cheryl Praeger (University of Western Australia). Plenary Lecture from the 1st PRIMA Congress, 2009. Plenary Lecture 11. Abstract: Regular permutation groups are the 'smallest' transitive groups of permutations, and have been studied for more than a century. They occur, in particular, as
From playlist PRIMA2009
Percolation on Nonamenable Groups, Old and New (Lecture-1) by Tom Hutchcroft
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)
Анализ Социальных Сетей. Лекция 3. Случайные графы
Слайды: http://www.leonidzhukov.net/hse/2014/socialnetworks/lectures/lecture3.pdf Модель Erdos-Renyi. Распределение Бернулли и Пуассона. Функция распределния степеней. Фазовые переходы, возникновение связанной компоненты. Диаметр и кластерный коэффициент. Конфигурационная модель Random
From playlist Анализ Социальных Сетей. Курс НИУ ВШЭ
Ex: State the X and Y Intercepts Given the Graph of a Line
This video explains how to locate and give the x and y intercepts of a graphed line. Complete Video Library: http://www.mathispower4u.com Search by Topic: http://www.mathispower4u.wordpress.com
From playlist Graphing Linear Equations Using a Table of Values
Breaking of Ensemble Equivalence in dense random graphs by Nicos Starreveld
Large deviation theory in statistical physics: Recent advances and future challenges DATE: 14 August 2017 to 13 October 2017 VENUE: Madhava Lecture Hall, ICTS, Bengaluru Large deviation theory made its way into statistical physics as a mathematical framework for studying equilibrium syst
From playlist Large deviation theory in statistical physics: Recent advances and future challenges