MA8351| DISCRETE MATHEMATICS| UNIT-3| VIDEO-19| A graph is Eulerian iff every vertex has even degree

[@hanush08]

How to solve : A connected graph has an Euler path if and only if it has exactly two vetrices of odd degree ?

[@Stenomaths]

Clear explanation...thankyou mam🙏

[@hariharaan.s6921]

Mam extraordinary explanation
Thank u so much mam

[@srikanthcb8522]

Mam
When will you teach algebraic structure mam.
In that
Cayley's theorem....lagrange's theorem....and fundamental therom of homomorphism of group.

[@engineeringmathematics9006]

I will start Today onwards pa

[@HAVOC_EDITS_18]

Two vertices of odd degree nalum ete elutalama mam ?????

[@Y0rak]

🙌🏻🔥

[@PraveenKumar-gu5ld]

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

[@engineeringmathematics9006]

Wait I will solve and send u the photo

[@PraveenKumar-gu5ld]

@@engineeringmathematics9006 ok mam

[@engineeringmathematics9006]

drive.google.com/file/d/19BI7737Tyd5ZpPJFerUa2QNtzYIq0PUz/view?usp=drivesdk
It's taken from book only if u don't understand ask me

[@PraveenKumar-gu5ld]

@@engineeringmathematics9006 mam one time teach pannunga mam IndhA sum a

[@PraveenKumar-gu5ld]

@@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

[@tranquil_craftsman]

really good

[@urmiladevi9825-b3s]

Please reply...which is your reference book

[@engineeringmathematics9006]

For graph theory I used bondy and moorthy book

[@urmiladevi9825-b3s]

@@engineeringmathematics9006 ok

[@r.k.l.tlegend5948]

Super mam

[@NowFlux]

This finished ha

[@engineeringmathematics9006]

Yes

[@medvinreactsandplays1845]

Mam going to fast mam

[@engineeringmathematics9006]

Sorry for that

[@shrutiraj9800]

Ma'am please try to explain in English