00:02 Understanding the concept of Eulerian graph and its applications. 01:16 Understanding Eulerian Graph and Paths 02:29 Eulerian graph can work as a circuit if it completes a cycle starting and ending at the same node. 03:44 Understanding the importance of proper coverage in graph theory 05:03 Explanation of Eulerian Graph 06:04 Understanding Eulerian Graph and paths 07:10 Eulerian graphs and circuits definition and properties 08:23 Understanding Eulerian Graph and circuit
SIR, first of all thanks for this video❤, but i,m looking for the video where the Teacher will convert difficult Graphs into (Bipartite, Planner, Euler and Hamiltonian) Graphs. Because i want to cover this cover this graph theory. Plzz sir, Can you make one video about difficult graph conversion for us. I Appreciate your Hardwork🙌🙏
First graph is not a path because if we start from A and ends with B then the vertex repreat twice. No edeges are repeated Start and final vertex are different But vertex B is repeated
thank you so much sir 😍😍
aaj jake ye topic shmj me aaya h
Welcome
Great explanation... Tomorrow I've exam of graph theory..ty for simple explanation sir
00:02 Understanding the concept of Eulerian graph and its applications.
01:16 Understanding Eulerian Graph and Paths
02:29 Eulerian graph can work as a circuit if it completes a cycle starting and ending at the same node.
03:44 Understanding the importance of proper coverage in graph theory
05:03 Explanation of Eulerian Graph
06:04 Understanding Eulerian Graph and paths
07:10 Eulerian graphs and circuits definition and properties
08:23 Understanding Eulerian Graph and circuit
Very good explanation sir💓💓💓
Thank you so much
SIR, first of all thanks for this video❤, but i,m looking for the video where the Teacher will convert difficult Graphs into (Bipartite, Planner, Euler and Hamiltonian) Graphs. Because i want to cover this cover this graph theory. Plzz sir, Can you make one video about difficult graph conversion for us. I Appreciate your Hardwork🙌🙏
First graph is not a path because if we start from A and ends with B then the vertex repreat twice.
No edeges are repeated
Start and final vertex are different
But vertex B is repeated
yes bro
Very nice explain sir
Thank you
Sir kya aap c language ka data structure kra sakte hai kya sir
Thanks sir
It's my mathematics exam today 😃
It's 01:15 am
Exam will be at 09:30 am
😂😂😂😂 padhai karo bro
Nice video 😊
Thank you so much sir best explanation 🙏
Welcome 😊
Good concept From Pakistan🥰😇
Very easily understood❤
Very nice teaching sir 👍
You are the best teacher sir ji
Thank you 😊
Which book do you preferred for this vedio?
Swapan kumar S Chand publication
sir last eg euler path kese hoga isme to vertex repeat kr rhi he. isse phla wala eg bhi sirfeuler circuit hona chahiye
same question?? sir please explain
Euler path k ly hm edge ko dekhte h, vertex repeatation wali condition sirf path k ly dekhte h
Euler path k ly hm edge ko dekhte h, vertex repeatation wali condition sirf path k ly dekhte h
@@SandeepKumarGour ok thank you sir
بہت شکریہ
Thanks sir 😊
Sir 1 question
Sir no vetex repeat karna he pr D vertex to repeat hora he na
I don't know how much late i am answering this but first one has a path , and it doesn't have euler path so it doesn't contain euler circuit as well
Same question
Hlo sir
Eulerian Theorem and
Hamilton theorem ka ek video bna dijiye
Thnx sir
Thank you sir 🙏
Thank you so much sir.
Thannkyu sir😊
Notes kha milenge
Videos dekh k banane pdege
❤️❤️
thanks
Welcome
☺
Shruti i love you
Thanks sir ☺️
Thanks sir