This sortable list points to the articles describing various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number) and χ' (chromatic index) are also sortable, allowing to search for a parameter or another. Wikimedia Commons has media related to Graphs by number of vertices. See also Graph theory for the general theory, as well as Gallery of named graphs for a list with illustrations. (Wikipedia).
Largest Possible Number of Edges for Various Types of Graphs
The video explains how to determine the maximum number of possible edges for various types of graphs. mathispower4u.com
From playlist Graph Theory (Discrete Math)
Graph Theory: 03. Examples of Graphs
We provide some basic examples of graphs in Graph Theory. This video will help you to get familiar with the notation and what it represents. We also discuss the idea of adjacent vertices and edges. --An introduction to Graph Theory by Dr. Sarada Herke. Links to the related videos: https
From playlist Graph Theory part-1
Breakdown of the basic components of graphs in graph theory
From playlist Graph Theory
Graph Theory: 05. Connected and Regular Graphs
We give the definition of a connected graph and give examples of connected and disconnected graphs. We also discuss the concepts of the neighbourhood of a vertex and the degree of a vertex. This allows us to define a regular graph, and we give some examples of these. --An introduction to
From playlist Graph Theory part-1
From playlist 3d graphs
Graph Theory: 53. Cut-Vertices
Here we introduce the term cut-vertex and show a few examples where we find the cut-vertices of graphs. We then go through a proof of a characterisation of cut-vertices: a vertex v is a cut-vertex if and only if there exist vertices u and w (distinct from v) such that v lies on every u-w
From playlist Graph Theory part-9
Graph Theory: 04. Families of Graphs
This video describes some important families of graph in Graph Theory, including Complete Graphs, Bipartite Graphs, Paths and Cycles. --An introduction to Graph Theory by Dr. Sarada Herke. Links to the related videos: https://www.youtube.com/watch?v=S1Zwhz-MhCs (Graph Theory: 02. Definit
From playlist Graph Theory part-1
From playlist 3d graphs
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
CSE 373 -- Lecture 11, Fall 2020
From playlist CSE 373 -- Fall 2020
Graphs In Data Structures | Graph Representation In Data Structure | Data Structures | Simplilearn
This data structures tutorial is dedicated to helping beginners understand the graphs in data structures. In this tutorial, you will understand the fundamentals and terminologies of the graph data structure, their types and their representation using different methods. The graphs in this t
From playlist Data Structures & Algorithms [2022 Updated]
Lecture 11 - Breadth-First Search
This is Lecture 11 of the CSE373 (Analysis of Algorithms) course taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 2007. The lecture slides are available at: http://www.cs.sunysb.edu/~algorith/video-lectures/2007/lecture11.pdf More informa
From playlist CSE373 - Analysis of Algorithms - 2007 SBU
Kernels, marriages, and the Dinitz problem #SoME2
The Dinitz problem is a graph theory problem proposed by Jeff Dinitz in 1979, and solved by Fred Galvin in 1994, 15 years later! In the video, I share the solution, along with some motivation that could have resulted in the solution. I hope you enjoy! I first heard of the problem in Diest
From playlist Summer of Math Exposition 2 videos
MIT 6.172 Performance Engineering of Software Systems, Fall 2018 Instructor: Julian Shun View the complete course: https://ocw.mit.edu/6-172F18 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63VIBQVWguXxZZi0566y7Wf Prof. Shun discusses graph optimizations, algorithmic
From playlist MIT 6.172 Performance Engineering of Software Systems, Fall 2018
CSE 373 -- Lecture 10, Fall 2020
From playlist CSE 373 -- Fall 2020
Lecture 10 - Graph Data Structures
This is Lecture 10 of the CSE373 (Analysis of Algorithms) course taught by Professor Steven Skiena [http://www3.cs.stonybrook.edu/~skiena/] at Stony Brook University in 2016. The lecture slides are available at: https://www.cs.stonybrook.edu/~skiena/373/newlectures/lecture10.pdf More inf
From playlist CSE373 - Analysis of Algorithms 2016 SBU
Lecture 10 - Graph Data Structures
This is Lecture 10 of the CSE373 (Analysis of Algorithms) taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 1997. The lecture slides are available at: http://www.cs.sunysb.edu/~algorith/video-lectures/1997/lecture14.pdf
From playlist CSE373 - Analysis of Algorithms - 1997 SBU
Louis Esperet: Coloring graphs on surfaces
Recording during the thematic meeting: "Graphs and surfaces: algorithms, combinatorics and topology" the May 11, 2016 at the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematici
From playlist Mathematical Aspects of Computer Science
Diameter and Radius of Tree Graphs | Graph Theory
We discuss what family of tree graphs have maximum diameter, minimum diameter, maximum radius, and minimum radius. Recall the diameter of a graph is the maximum distance between any two vertices. The radius of a graph is the minimum eccentricity of any vertex. We'll find the star graphs ha
From playlist Graph Theory