Розмір відео: 1280 X 720853 X 480640 X 360
Показувати елементи керування програвачем
Автоматичне відтворення
Автоповтор
Tomorrow is my paper this video is my helpfull for me. Thank you mam
How to solve : A connected graph has an Euler path if and only if it has exactly two vetrices of odd degree ?
Clear explanation...thankyou mam🙏
Mam extraordinary explanation Thank u so much mam
Mam When will you teach algebraic structure mam.In that Cayley's theorem....lagrange's theorem....and fundamental therom of homomorphism of group.
I will start Today onwards pa
Two vertices of odd degree nalum ete elutalama mam ?????
🙌🏻🔥
really good
Mam The maximum number of edges in a simple disconnected graph G with n vertices and k components is (n-k)(n-k+1)/2 itha epdi solve pandrathu mam
Wait I will solve and send u the photo
@@engineeringmathematics9006 ok mam
drive.google.com/file/d/19BI7737Tyd5ZpPJFerUa2QNtzYIq0PUz/view?usp=drivesdkIt's taken from book only if u don't understand ask me
@@engineeringmathematics9006 mam one time teach pannunga mam IndhA sum a
@@engineeringmathematics9006 mamA connected multigraph with atleast two vertices has an Euler circuit if and only if each of its vertices has even degree IndhA question um konjam solve pannunga mam
Please reply...which is your reference book
For graph theory I used bondy and moorthy book
@@engineeringmathematics9006 ok
Mam please send me the answer for this question mam
Super mam
This finished ha
Yes
Mam going to fast mam
Sorry for that
Ma'am please try to explain in English
Tomorrow is my paper this video is my helpfull for me.
Thank you mam
How to solve : A connected graph has an Euler path if and only if it has exactly two vetrices of odd degree ?
Clear explanation...thankyou mam🙏
Mam extraordinary explanation
Thank u so much mam
Mam
When will you teach algebraic structure mam.
In that
Cayley's theorem....lagrange's theorem....and fundamental therom of homomorphism of group.
I will start Today onwards pa
Two vertices of odd degree nalum ete elutalama mam ?????
🙌🏻🔥
really good
Mam
The maximum number of edges in a simple disconnected graph G with n vertices and k components is (n-k)(n-k+1)/2 itha epdi solve pandrathu mam
Wait I will solve and send u the photo
@@engineeringmathematics9006 ok mam
drive.google.com/file/d/19BI7737Tyd5ZpPJFerUa2QNtzYIq0PUz/view?usp=drivesdk
It's taken from book only if u don't understand ask me
@@engineeringmathematics9006 mam one time teach pannunga mam IndhA sum a
@@engineeringmathematics9006 mam
A connected multigraph with atleast two vertices has an Euler circuit if and only if each of its vertices has even degree IndhA question um konjam solve pannunga mam
Please reply...which is your reference book
For graph theory I used bondy and moorthy book
@@engineeringmathematics9006 ok
Mam please send me the answer for this question mam
Super mam
This finished ha
Yes
Mam going to fast mam
Sorry for that
Ma'am please try to explain in English