Lec-04 | Eulerian & Hamiltonian Graph | Distance & Diameter | Graph Theory | Discrete Mathematics
3.1 هزار بار بازدید -
پارسال
-
Telegram Channel Name: Tending to
Telegram Channel Name: Tending to Infinity 📚
Telegram Channel link: https://t.me/tendingtoinfinityofficial
Timestamps:
0:00 - Intro
0:50 - Euler Line
4:29 - Euler Circuit
8:05 - Euler Graph
8:42 - Hamiltonian Path
12:25 - Hamiltonian Circuit
14:08 - Hamiltonian Graph
15:46 - PYQ's
24:33 - Euler Theorem
27:45 - Ore's Theorem
32:20 - Dirac's Theorem
34:56 - KONIGSBERG BRIDGE
39:07 - Cycle Graph
41:47 - Distance & Diameter
This video lecture of Eulerian & Hamiltonian Graph will help Engineering and Basic Science students to understand following topic of Mathematics:
1. Definition of Eulerian & Hamiltonian Circuit and graph
2. Important terminologies regarding Eulerian & Hamiltonian Graph.
3. Different Types of examples of Eulerian & Hamiltonian Graph.
4. How to identify Eulerian and Hamiltonian graph.
5. How to find distance between two vertices in a graph
6. How to find the diameter of a graph.
7. Solve Previous year question solution.
For Eulerian Graph:
Find a circuit in the graph which traverses each edge in the graph only once.
For Hamiltonian Graph:
Find a circuit in a connected graph G which passes through every vertex in the graph G exactly once except the starting and ending vertices.
Distance:
The distance between two vertices vi and vj denoted by d(vi ,vj ) is the length of the shortest path between vi and vj
Diameter of a Graph:
The maximum distance between any two vertices in a graph G is called Diameter of G.
#graphtheory #euleriangraph #hamiltoniangraph #diameter #discretemathematics #engineeringmathematics #makaut
#graphtheory #applicationofgraphthoery #selfloop #discretemathematics #engineeringmathematics #makaut
#bscmaths #BSC301#differentialcalculas
#makaut_3rd_sem_differential_calculus
#makaut
#bscmaths
#makautsemester
#BSC301
#partialderivatives
#multivariablecalculus
#makautsemester
#graph_theory
#makautsemester
#makaut_odd_sem
#makaut_3rd_sem
#makaut_cse
#bsc301
#integral_calculus
#order_and_degree
#ordinarydifferentialequations
#engineeringmathematics
#makaut_3rd_sem_maths
#differential_equation
#makaut_3rd_sem_differential_equation
Link of Playlist of Differential Calculus (CSE IT DS 3rd SEM): 🔴 MAKAUT BSC301 COMPLETE PLAYLIST for...
Link of Playlist of Multiple (Double & Triple) Integral : Multiple Integral
Link of Playlist of Graph Theory: Graph Theory
Link of Playlist of Ordinary Differential Equation: Ordinary Differential Equation
Link of Playlist of Function of Several Variables: Function of Several Variables
Do Like & Share this Video with your Friends. If you are watching for the first time then Subscribe to our Channel and stay updated for more videos around Mathematics.
Thanks For Watching My Video
Like, Share & Subscribe
Telegram Channel link: https://t.me/tendingtoinfinityofficial
Timestamps:
0:00 - Intro
0:50 - Euler Line
4:29 - Euler Circuit
8:05 - Euler Graph
8:42 - Hamiltonian Path
12:25 - Hamiltonian Circuit
14:08 - Hamiltonian Graph
15:46 - PYQ's
24:33 - Euler Theorem
27:45 - Ore's Theorem
32:20 - Dirac's Theorem
34:56 - KONIGSBERG BRIDGE
39:07 - Cycle Graph
41:47 - Distance & Diameter
This video lecture of Eulerian & Hamiltonian Graph will help Engineering and Basic Science students to understand following topic of Mathematics:
1. Definition of Eulerian & Hamiltonian Circuit and graph
2. Important terminologies regarding Eulerian & Hamiltonian Graph.
3. Different Types of examples of Eulerian & Hamiltonian Graph.
4. How to identify Eulerian and Hamiltonian graph.
5. How to find distance between two vertices in a graph
6. How to find the diameter of a graph.
7. Solve Previous year question solution.
For Eulerian Graph:
Find a circuit in the graph which traverses each edge in the graph only once.
For Hamiltonian Graph:
Find a circuit in a connected graph G which passes through every vertex in the graph G exactly once except the starting and ending vertices.
Distance:
The distance between two vertices vi and vj denoted by d(vi ,vj ) is the length of the shortest path between vi and vj
Diameter of a Graph:
The maximum distance between any two vertices in a graph G is called Diameter of G.
#graphtheory #euleriangraph #hamiltoniangraph #diameter #discretemathematics #engineeringmathematics #makaut
#graphtheory #applicationofgraphthoery #selfloop #discretemathematics #engineeringmathematics #makaut
#bscmaths #BSC301#differentialcalculas
#makaut_3rd_sem_differential_calculus
#makaut
#bscmaths
#makautsemester
#BSC301
#partialderivatives
#multivariablecalculus
#makautsemester
#graph_theory
#makautsemester
#makaut_odd_sem
#makaut_3rd_sem
#makaut_cse
#bsc301
#integral_calculus
#order_and_degree
#ordinarydifferentialequations
#engineeringmathematics
#makaut_3rd_sem_maths
#differential_equation
#makaut_3rd_sem_differential_equation
Link of Playlist of Differential Calculus (CSE IT DS 3rd SEM): 🔴 MAKAUT BSC301 COMPLETE PLAYLIST for...
Link of Playlist of Multiple (Double & Triple) Integral : Multiple Integral
Link of Playlist of Graph Theory: Graph Theory
Link of Playlist of Ordinary Differential Equation: Ordinary Differential Equation
Link of Playlist of Function of Several Variables: Function of Several Variables
Do Like & Share this Video with your Friends. If you are watching for the first time then Subscribe to our Channel and stay updated for more videos around Mathematics.
Thanks For Watching My Video
Like, Share & Subscribe
پارسال
در تاریخ 1402/05/09 منتشر شده
است.
3,128
بـار بازدید شده