Euler Formula with Proof in Graph Theory | By :- Harendra Sharma
ฝัง
- เผยแพร่เมื่อ 26 ส.ค. 2024
- 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
Thank u so much sir, tomorrow is my exam
, Bahut din se ye samgh nahi aa raha tha but you clear all my doubt ❤️👍🏻
kl mera exam h
@@ankityadav-eq7lu kons sa university
really perfect explanation thank u sir
Nice explanation
Awesome explation
Good job sir 👍
You make complicated topic so easy
Thanks sir ❤️
sir wah sir mja aa gya smj aa gya
Watching this video was worth full!!
Perfect sir.. ❣️❣️
good explanation appreciated
Very nice the way of teaching sir
Osm explanation
👍
Thank you very much Sir
Thank you soo much sir
Veryyyy niceeeee
Sir aap bhot acha padhate ho ❤
Amazing sir
Perfect explanation sir tq so much
Thank you so much sir ji 😊🙏
Thank you mouch sir
Well explained ✨ tq sir
Thank u sir 😊
Thank you so much sir 😊 this is very helpful for us 🙏
Nice sir
You are a gem🥰
Thank you so much
Tq😊 sir
Tnx❤
Thannks lot sir❤🙏🙏🙏😊
Thanku so much sir
Thankyou very much sir 🙏
😊
Best teacher for graph theory
Thank you
👍🏻
Technical guru ji lite😂
my teacher watches your videos and then teaches us 😀
Sir, face is the space (area) so it has to have 3 or more lines. With e=1, we are considering a 1-D layout and so here a quantity like face (area) can’t exist.
Kindly correct if I’m wrong
🧠🧠🧠🧠🔥🔥🔥🔥🔥
Sir aapki voice kitni sweet hai 🥰🥰🥰
Voice pe mat Jaa padhai pe dhyan de 😀
sir ap cgl k liye padhao
Thx
find the no of faces edges and vertex if ployhedron with 3 pentagonal faces meet at each vertex... can anyone help me with this problem.
Sir Kuratowski,s theorem ka video banayi
One application of a unary novel graph operation
Very nice way to teach sir
Sir your second example of basic step is wrong this is not a complete graph because a is not connected to c
e - n+2 region ko smjhye
R kaise??
Bhai kehna kya chahate ho🙏