I think there should be a correction. In Hamiltonian graph, the vertices are distinct. So, it's not possible to repeat the edges. We can leave any edge without transversing it but can't repeat. Am i right?~
Hi! G2 does not have a Hamilton circuit. In the case of b-c-d-b-a-b , as b is the terminal vertex ( means starting & ending vertex are same), but in this path, b is repeated in between.
How can you be sooo WRONG!!! Edges cannot be repeated in hamiltonian graph.... if they are repeated it would not be considered a circuit which has unique edges and vertices. I am just losing my faith in this playlist... she is teaching wrong definitions which will seriously affect many who are specifically not reading this... or those who do not read the book specified....
I think there should be a correction.
In Hamiltonian graph, the vertices are distinct. So, it's not possible to repeat the edges.
We can leave any edge without transversing it but can't repeat.
Am i right?~
Yes ..
Very nice explanation of Eulerian and Hamiltonian graphs. Thank you.
✨✨✨✨
Thank you so much mam
How can we repeat edges without repeating vertices in a hamiltonian graph?? 🤔
When it comes to terminating vertex by repeating edge can reach to final vertex
vertices are not repeated -> edges are not repeated. Am I right?
mam i like so much
you are super
What are the necessary conditions for a graph to be Hamilton?
it needs to be trail not path because in path the condition is that no vertrex or edge can be repeated
how its possible to repeat edges??
Pls give euler graph with example
Mam koncham slow ga chepend madam
G2 has Hamilton circuit start from b c d b a b....since b is terminal it can be repeated
Hi!
G2 does not have a Hamilton circuit.
In the case of b-c-d-b-a-b , as b is the terminal vertex ( means starting & ending vertex are same), but in this path, b is repeated in between.
@@itechnica Hamilton means undirected graph
In g1 what if i travel like this a-b-c-e-d is it still hamiltonian graph
No, it is not a Hamilton graph because for Hamilton graph a Hamilton circuit is also present which means starting And ending vertex are same.
It is just a Hamilton path, in which you cover each vertex exactly once.
That will be just Hamilton path, for proving Hamilton graph you should show that the graph also has Hamilton circuit.
Good class
nice class
Mam please explain in English only don't explain in hindi in middle
Not clear use tick pen
In graph theoey. .edge never repeated in any graph
How can you be sooo WRONG!!! Edges cannot be repeated in hamiltonian graph.... if they are repeated it would not be considered a circuit which has unique edges and vertices. I am just losing my faith in this playlist... she is teaching wrong definitions which will seriously affect many who are specifically not reading this... or those who do not read the book specified....