Very nice explanation of Eulerian and Hamiltonian graphs. Thank you.
@devils_favourite_demon
6 жыл бұрын
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?~
@muskansoni6789
Жыл бұрын
Yes ..
@muzaferhussain9652
5 жыл бұрын
What are the necessary conditions for a graph to be Hamilton?
@AhmedKhan-iu8nj
3 жыл бұрын
how its possible to repeat edges??
@satyamy866
4 жыл бұрын
vertices are not repeated -> edges are not repeated. Am I right?
@tatialekhya2634
2 жыл бұрын
Thank you so much mam
@midhilak8422
3 жыл бұрын
How can we repeat edges without repeating vertices in a hamiltonian graph?? 🤔
@sriganeshkoppaka1768
3 жыл бұрын
When it comes to terminating vertex by repeating edge can reach to final vertex
@AndrewOzukum
Жыл бұрын
✨✨✨✨
@sainumolshabeer7744
5 жыл бұрын
Pls give euler graph with example
@chowdarynbk2549
4 жыл бұрын
mam i like so much you are super
@agrawal1207
4 жыл бұрын
it needs to be trail not path because in path the condition is that no vertrex or edge can be repeated
@PJDWORLD
2 жыл бұрын
Mam koncham slow ga chepend madam
@littlefeetvampire
5 жыл бұрын
In g1 what if i travel like this a-b-c-e-d is it still hamiltonian graph
@itechnica
5 жыл бұрын
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.
@itechnica
5 жыл бұрын
It is just a Hamilton path, in which you cover each vertex exactly once.
@ajayreddyvanga6556
3 жыл бұрын
That will be just Hamilton path, for proving Hamilton graph you should show that the graph also has Hamilton circuit.
@akhileshdesai7946
5 жыл бұрын
G2 has Hamilton circuit start from b c d b a b....since b is terminal it can be repeated
@itechnica
5 жыл бұрын
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.
@smileweapon659
5 жыл бұрын
@@itechnica Hamilton means undirected graph
@sainumolshabeer7744
5 жыл бұрын
Good class
@sreeram3893
5 жыл бұрын
nice class
@ramyalakshmi8192
6 жыл бұрын
Not clear use tick pen
@entertainment4you852
4 жыл бұрын
Mam please explain in English only don't explain in hindi in middle
@vrishtigahlyan1536
5 жыл бұрын
In graph theoey. .edge never repeated in any graph
@mohitpandey148
3 жыл бұрын
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....
Пікірлер: 27