Bhai Bhai Tutorials
Bhai Bhai Tutorials
  • 114
  • 2 203 789
Types of Graph | Simple | Multi | Null | Regular | By- Harendra Sharma
In this video we are going to learn about
1. Finite and Infinite Graph
2. Simple Graph
3. Pseudo Graph
4. Multi Graph
5. Null Graph
6. Regular Graph
#FiniteGraph
#SimpleGraph
#MultiGraph
#NullGraph
#RegularGraph
#InfinitiGraph
For more videos
Subscribe
Bhai Bhai Tutorials
By- Harendra Sharma
Переглядів: 6 535

Відео

Maximum and Minimum Element in Hasse Diagram | POSET | Discrete Mathematics | By :- Harendra Sharma
Переглядів 6 тис.4 роки тому
Hasse Diagram Part 1 : ua-cam.com/video/_enUG5lbvpg/v-deo.html Hasse Diagram Part 2 : ua-cam.com/video/GfmiJTL_hn0/v-deo.html Maximal & Minimal Element : ua-cam.com/video/R8dU TkY5U/v-deo.html In this lecture we are going to learn how to find maximum and minimum element in POSET or Hasse Diagram. We learn step by step method how to find maximum and minimum. For this we must know what is Hasse D...
Maximal and Minimal Element in Hasse Diagram | POSET | Discrete Mathematics | By :- Harendra Sharma
Переглядів 9 тис.4 роки тому
Hasse Diagram : ua-cam.com/video/GfmiJTL_hn0/v-deo.html In this lecture we are going to learn how to find maximal and minimal element in POSET or Hasse Diagram. We learn step by step method how to find maximal and minimal. For this we must know what is Hasse Diagram or POSET. For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma #Maximal #Minimal #HasseDiagram #POSET
Hasse Diagram in Discrete Mathematics | Part - 2 | Shortcut | Examples | By :- Harendra Sharma
Переглядів 9 тис.4 роки тому
In this lecture we are going to learn how to make a Hasse Diagram. In this we will see shortcut method that how relation is converted into hasse diagram directly. Hasse Diagram in Discrete Mathematics. Example on Hasse Diagram Partial Order Relation : ua-cam.com/video/hNsgH6jTYoQ/v-deo.html Hasse Diagram : ua-cam.com/video/_enUG5lbvpg/v-deo.html For more videos Subscribe Bhai Bhai Tutorials By-...
Hasse Diagram in Discrete Mathematics | Part - 1 | Examples | Step by Step | By :- Harendra Sharma
Переглядів 30 тис.4 роки тому
In this lecture we are going to learn how to make a Hasse Diagram. In this we will see step by step process how relation is converted into digraph and then how digraph is converted into hasse diagram. Hasse Diagram in Discrete Mathematics. Example on Hasse Diagram Partial Order Relation : ua-cam.com/video/hNsgH6jTYoQ/v-deo.html For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma #...
Euler Formula with Proof in Graph Theory | By :- Harendra Sharma
Переглядів 79 тис.4 роки тому
In this lecture we are going to learn about Euler's Formula and we proof that formula by using Mathematical Induction Euler's Formula in Graph Theory Proof of Euler's Formula By using Mathematical Induction Formula :- r = e - n 2 or r = e - v 2 r - e n = 2 or r - e v = 2 For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma #EulerFormula #Proof #GraphTheory #Harendra
Matching in Graph | Maximal Matching, Maximum Matching, Perfect Matching | By :- Harendra Sharma
Переглядів 71 тис.4 роки тому
In this lecture we are going to learn about Matching Graph and it's types like maximal matching, maximum matching and perfect matching. Matching in a graph with example Maximal matching in graph with example Maximum matching in graph with example Perfect matching in graph with example For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma #Matching #MaximalMatching #MaximumMatching #...
Covering | Vertex Covering in Graph | Types of Vertex Covering | By :- Harendra Sharma
Переглядів 47 тис.4 роки тому
In this lecture we are going to learn about vertex covering and types of vertex covering like minimal vertex covering and minimum vertex covering. Vertex covering in graph Minimal Vertex Covering in Graph Minimum Vertex Covering in Graph. Edge or Line Covering : ua-cam.com/video/Uhc0UfXNJAg/v-deo.html For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma #Covering #VertexCovering #M...
Line or Edge Covering in Graph| Minimal and Minimum Line Covering| Graph Theory| By- Harendra Sharma
Переглядів 26 тис.4 роки тому
In this lecture we are going to learn about covering in a graph. There are two types of covering first is line covering or edge covering and another one is vertex covering. In this lecture we are going to learn about line covering, minimal line covering and minimum line covering. For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma #Covering #LineCovering #EdgeCovering #MinimalLine...
Edge Coloring and Chromatic Number in Graph | Graph Theory | By :- Harendra Sharma
Переглядів 35 тис.4 роки тому
In this lecture we are going to learn about how to color edges of a graph and how to find the chromatic number of graph. Edge Coloring in graph Chromatic number of graph Edge coloring in graph with example Chromatic number of graph with example For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma #EdgeColoring #ChromaticNumber #EdgeColoringInGraph #ChromaticNumberOfGraph
Vertex Coloring and Chromatic Number in Graph | Graph Theory | By :- Harendra Sharma
Переглядів 15 тис.4 роки тому
In this lecture we are going to learn how to color the vertices of a graph and how to find the chromatic number of a graph. Vertex Coloring in Graph Chromatic Number of Graph Vertex Coloring in Graph with example Chromatic Number of Graph with example For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma #VertexColoring #ChromaticNumber #VertexColoringInGraph #ChromaticNumberOfGraph
Path Matrix in Graph Theory | By :- Harendra Sharma
Переглядів 48 тис.4 роки тому
In this lecture we are going to learn how to find path matrix between a given pair of vertices. Path Matrix in graph theory Path matrix example Example of path matrix For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma #PathMatrix #ExamplePathMatrix #GraphTheory
Relationship between Af Bf Cf in Graph Theory | By :- Harendra Sharma
Переглядів 10 тис.4 роки тому
In this lecture we are going to learn how to find relationship among Af Bf and Cf in graph theory. Reduced Incidence Matrix : ua-cam.com/video/uJnpMCnw7sE/v-deo.html Fundamental Circuit Matrix : ua-cam.com/video/4d5NCVKYhAY/v-deo.html Fundamental Cut Set Matrix : ua-cam.com/video/ohdswDpDKCU/v-deo.html For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma #AfBfCf #RelationshipAfBfCf...
Adjacency Matrix | Connection Matrix | Graph Theory | By :- Harendra Sharma
Переглядів 70 тис.4 роки тому
In this lecture we are going to learn how to make Adjacency Matrix of a graph. How to make Adjacency Matrix of Digraph of Directed Graph. In different discipline adjacency matrix also known as Connection Matrix Transition Matrix Relation Matrix Precedence Matrix Preference Matrix For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma #ConnectionMatrix #TransitionMatrix #RelationMatri...
Pushdown Automata Example No. 3 | w c wr | PDA | TOC | Automata | By :- Harendra Sharma
Переглядів 7 тис.4 роки тому
In this lecture we are going to learn how to make pushdown automata for L={wcwr | w belongs to (a,b)*} Example of pushdown automata Pushdown Automata with example For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma #wcwr #PDA #PushdownAutomata #ExampleOfPushdownAutomata #PushdownAutomataExample
Cut Set Matrix and Fundamental Cut Set Matrix | Graph Theory | By :- Harendra Sharma
Переглядів 37 тис.4 роки тому
Cut Set Matrix and Fundamental Cut Set Matrix | Graph Theory | By :- Harendra Sharma
Pushdown Automata Example No. 2 | Equal no. of a and b | PDA | TOC | Automata | By:- Harendra Sharma
Переглядів 5 тис.4 роки тому
Pushdown Automata Example No. 2 | Equal no. of a and b | PDA | TOC | Automata | By:- Harendra Sharma
Circuit Matrix and Fundamental Circuit Matrix in Digraphs | Directed Graph | By :- Harendra Sharma
Переглядів 10 тис.4 роки тому
Circuit Matrix and Fundamental Circuit Matrix in Digraphs | Directed Graph | By :- Harendra Sharma
Circuit Matrix | Fundamental Circuit Matrix | Graph Theory | By :- Harendra Sharma
Переглядів 30 тис.4 роки тому
Circuit Matrix | Fundamental Circuit Matrix | Graph Theory | By :- Harendra Sharma
Pushdown Automata Example | a^n b^n | PDA | TOC | Automata | By :- Harendra Sharma
Переглядів 8 тис.4 роки тому
Pushdown Automata Example | a^n b^n | PDA | TOC | Automata | By :- Harendra Sharma
Incidence Matrix and Reduce Incidence Matrix | Directed and Undirected Graph | By - Harendra Sharma
Переглядів 42 тис.4 роки тому
Incidence Matrix and Reduce Incidence Matrix | Directed and Undirected Graph | By - Harendra Sharma
Rank and Nullity in a Graph | Graph Theory | By :- Harendra Sharma
Переглядів 21 тис.4 роки тому
Rank and Nullity in a Graph | Graph Theory | By :- Harendra Sharma
Pushdown Automata | Introduction | TOC | Automata | By :- Harendra Sharma
Переглядів 1,7 тис.4 роки тому
Pushdown Automata | Introduction | TOC | Automata | By :- Harendra Sharma
Thickness and Crossing in Graph | Graph Theory | By :- Harendra Sharma
Переглядів 10 тис.4 роки тому
Thickness and Crossing in Graph | Graph Theory | By :- Harendra Sharma
Dijkstra's Algorithm | Single Source Shortest Path | Graph Theory | By :- Harendra Sharma
Переглядів 7 тис.4 роки тому
Dijkstra's Algorithm | Single Source Shortest Path | Graph Theory | By :- Harendra Sharma
Prim's Algorithm | Minimum Spanning Tree | Graph Theory | By :- Harendra Sharma
Переглядів 9 тис.4 роки тому
Prim's Algorithm | Minimum Spanning Tree | Graph Theory | By :- Harendra Sharma
Kruskal's Algorithm | Minimum Spanning Tree | Trick | Graph Theory | By :- Harendra Sharma
Переглядів 12 тис.4 роки тому
Kruskal's Algorithm | Minimum Spanning Tree | Trick | Graph Theory | By :- Harendra Sharma
Minimum Spanning Tree in Graph Theory | By :- Harendra Sharma
Переглядів 12 тис.4 роки тому
Minimum Spanning Tree in Graph Theory | By :- Harendra Sharma
Distance Between Two Spanning Tree | Graph Theory | By :- Harendra Sharma
Переглядів 6 тис.4 роки тому
Distance Between Two Spanning Tree | Graph Theory | By :- Harendra Sharma
Spanning Tree in Graph Theory with Example | By :- Harendra Sharma
Переглядів 28 тис.4 роки тому
Spanning Tree in Graph Theory with Example | By :- Harendra Sharma

КОМЕНТАРІ