#8 Introduction to Walk Path Circuits With Example in Graph Theory And Applications [TAMIL]
Topics Walk, Path & Circuit With Example in Graph theory is discussed in Tamil.
This topic is common to Graph Theory And Applications & Discrete Mathematics studying students. Graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices also called nodes or points which are connected by edges also called links or lines.
Walk in graph Theory: A walk is a sequence of vertices and edges of a graph. If we traverse a graph then we get a walk. Vertex can be repeated. Edges can be repeated
In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices.
A path that does not repeat vertices is called a simple path. A circuit is path that begins and ends at the same vertex. A circuit that doesn't repeat vertices is called a cycle. A graph is said to be connected if any two of its vertices are joined by a path.
***********************************************************************
Click the below Playlist links for more videos
1.Engineering Mathematics-2
• Engineering Mathematics-2 Stoke's Theorem ...
2.RMT/Operations Research
• Simplex Method in Tamil[PART-1]
3.Discrete Mathematics
• #1 Discrete Mathematics-Introduction to Pr...
4.Theory of Computation[TOC]
• Theory of Computation | Introduction to Fi...
5.Graph Theory & Applications [GTA]
• #1 Introduction To Graphs in Tamil | Graph...
6. Probability & Queuing Theory[PQT]
• #1PQT UNIT-1 RANDOM VARIABLE | Discrete Ra...
*****************************************************************************************
#1 Introduction To Graphs in Tamil[Graph Theory And Applications]
• #1 Introduction To Graphs in Tamil | Graph...
#2 Types Of Graph[PART-1] in Tamil[Graph Theory And Applications]
• #2 Types Of Graph in Tamil | PART-1 | Grap...
#3 Types Of Graph[PART-2] in Tamil[Graph Theory And Applications]
• #3 Types of Graph in Graph Theory And Appl...
#4 Theorem-The no of vertices of odd degree in a Graph is always Even[TAMIL]
• #4 Theorem-The no of vertices of odd degre...
#5 Isomorphism in Graph Theory And Applications[TAMIL]
• #5 Isomorphism in Graph Theory And Applica...
#6 Theorem-A graph G is disconnected if and only if its vertex V can be partitioned into two non empty, disjoint subsets v1&v2 such that there exists no edge in G whose one end vertex is in subset V1 & the other in subset V2.[TAMIL]
• #6 Theorem: A Graph G is disconnected if a...
#7 Subgraph in Graph Theory And Applications[TAMIL]
• #7 Subgraph in Graph Theory And Applicatio...
**************************************************************************
Friends, Please SUBSCRIBE our channel.
Click bell icon to receive notification.
********************************************************************
Like, Share &Comment
********************************************************************
Thanks for Watching.
********************************************************************