Eulerian and Hamiltonian Graph

[@kumaarbalbir]

each occurrence of the vertex in trail T contributes 2 to the degree but not the extremum ones, so their contribution is to be taken as 1, once when you start from it and once when you end over this vertex.

[@VS-cq2zj]

Tq sir.. very nice explanation..

[@anuirine9729]

Sir pls upload the video related that how to find security numbers in graphs

[@nishthakumari3200]

great video

[@jeetmehta2254]

An eulerian trail does not necessarily start and end at the same vertex; Eulerian trail is a trail where each edge from graph g appears in the trail.

[@matthewsarsam8920]

Then you wouldn't need an even degree at every vertex, this theorem only holds when the start and end vertex are the same

[@aspirant8444]

Sir can this proof be done in exam?

[@priyankapandey5962]

Nice

[@svthvino]

Words are small and not dark, so not readable easily.

[@hrs7305]

He couldn’t be more slow

[@blackdiamond5495]

Sir your transcript are overlap on your writing plz correct