Hamiltonian Graph with Example - Graph Theory - Discrete Mathematics

[@abcminati8565]

Question 5 is did in a wring manner. The answer cam be a-b-c-d-e-a here it becomes closed hamiltoniqn graph

[@akhilsharma2911]

yes

[@sejal_0438]

Yessse

[@ZaidShaikh-bx2eb]

Yess it is Hamiltonian Graph

[@Raj10185]

example V and VI one are also hamiltonian graph

[@abcminati8565]

6th one is qlso wrongly done. P-u-v-q-s-t-r-p is makes closed Hamilton circuit

[@UtsabNandi-el2kl]

Even q-v-u-p-r-t-s-q makes a closed hamiltonian path

[@vijaymishra.3286]

No s se R nhi banega phir edge

[@ahadshaikh368]

You don't see edges. Only check if all points are covered. Therefore it is an closed Hamilton graph​@@vijaymishra.3286

[@ahadshaikh368]

Even p-r-t-s-q-v-u-p is correct

[@Bintzeynu]

wow👏such a great lecture🥰go ahead. and as i learned from your leacture example v & vI also Hamiltonian graphs 👐tank you

[@Anonymousak]

sir qs 6 is hamiltonian graph : p-u-v-q-s-t-r-p

[@iyaelgetachew9901]

What a genius mind

[@shihabshahriarmadhurja6816]

no.6 hg = pqvstrup

[@Shankar9209]

V example we go sir this way like => d-c-b-a-c-e-d now is it hamilton graph or not sir plz replay

[@realkhan160]

C vertex repeated🫵

[@huzaifa-pc3oc]

@@realkhan160even without repeating it we get a closed graph

[@poojarajeshwari4640]

a-b-c-d-e-a like this

[@akgamer5866]

7:09 Sir its hamiltonian circuit

[@vishnu-ph9sm]

5 and 6 is wrong

[@mandalamuse2003]

5 and 6 questions answers are wrong

[@maddo_kevin]

for 6: p-u-v-q-s-t-r-p

[@namugarurasyda4545]

thought a closed path is cycle not a circuit

[@ahadshaikh368]

Yeah, even I am confused since

[@ishrathnousheen9688]

total defination and solutions are wrong