Hamiltonian Graph | Details|Graph Theory #17

  Рет қаралды 47,697

Vivekanand Khyade - Algorithm Every Day

Vivekanand Khyade - Algorithm Every Day

Күн бұрын

Пікірлер: 40
@jigyasaagrawal5876
@jigyasaagrawal5876 5 жыл бұрын
sir your videos helped me alot in studying and taking my exam . thank you so much !
@jigyasaagrawal5876
@jigyasaagrawal5876 5 жыл бұрын
your teaching style is fantastic thanks a lot
@saishwadkar4557
@saishwadkar4557 5 жыл бұрын
Hi Sir, please make video on P and Np problems NP Complete and NP hard. Your teaching style is fantastic!
@neethu5637
@neethu5637 3 жыл бұрын
Ur Teaching Is Amazing i loved it Tqq soo much sir
@himaanshu1
@himaanshu1 5 жыл бұрын
Thanks for all the videos.. really helped me..
@avisalan6621
@avisalan6621 4 ай бұрын
thank you for the great and simple explanation. 😊
@andersonlima4440
@andersonlima4440 2 жыл бұрын
3:38 How could an edge be visited more than once, if the vertices cannot?
@wonderfulmusiclofi
@wonderfulmusiclofi 3 жыл бұрын
I really appreciate your teaching technique...
@judeshello5782
@judeshello5782 3 жыл бұрын
Excellent work
@sheetalhemram21
@sheetalhemram21 5 жыл бұрын
Sir upload videos on dirac's and ore's thm. Quickly.
@shubhamtandan486
@shubhamtandan486 4 жыл бұрын
At 3:39 you are telling we can visit the edge more than once but as per your explanation hamiltonian circuit is a trail and trail has no repeated edges. Please explain this whether I am wrong or some mistake happened at that time ?
@rajivmishra103
@rajivmishra103 4 жыл бұрын
repeatation of edge can not be done.
@abhyudayakumar24
@abhyudayakumar24 4 жыл бұрын
Repetition of edge is not possible there
@ayushgarg5929
@ayushgarg5929 4 жыл бұрын
Nahi kar sakte edge do baar visit warna 2 vertex more than once visit ho jaayenge... chutiya hai teacher
@satishkolli5457
@satishkolli5457 2 жыл бұрын
Good explanation sir
@kaustubhpaturi4801
@kaustubhpaturi4801 3 жыл бұрын
But sir, in the third example, if we start from a vertex that lies on the common edge btw the square and the triangle, we will not be visiting all the vertices. Then can we say that it is a hamiltonian cycle?
@shivupatil6403
@shivupatil6403 4 жыл бұрын
Sir pls make classes on planar graphs and it 'theorems. And also on colorability
@amonprincefootballdoc6240
@amonprincefootballdoc6240 3 жыл бұрын
you are a genius
@Navarasa.rhythm524
@Navarasa.rhythm524 4 жыл бұрын
Sir, can you make a vedio for find graph is planar or not
@santhosh........
@santhosh........ 5 жыл бұрын
Super sir It will be really helpful
@kaltube4817
@kaltube4817 3 жыл бұрын
keep it up!👍👍
@karana2260
@karana2260 3 жыл бұрын
who knew behind our school copies we were looking for best hamiltonian path :D :D
@nallamaruchandrasekhar3094
@nallamaruchandrasekhar3094 3 жыл бұрын
sir could you please explain grinberg's theorem and explain how to find hamiltonian cycle using grinberg's theorm
@st_sk5705
@st_sk5705 5 жыл бұрын
Please make problem solving videos on graphs
@لُطف-ب9خ
@لُطف-ب9خ 3 жыл бұрын
Thank you sir 🤍🙏 .
@fitrisalsabilaayuandriani7084
@fitrisalsabilaayuandriani7084 3 жыл бұрын
Thank you so much sirr!!
@vasudevans8959
@vasudevans8959 3 жыл бұрын
Sir I want extensions,spiliting field, normal extensions, galos extension, seperable in algebra
@kanimozhibalaji9925
@kanimozhibalaji9925 5 жыл бұрын
Hi sir pls make a video on isomorphism in graph theory and how to check whether the graph is isomorphism or not.
@hemmlo5975
@hemmlo5975 5 жыл бұрын
Same nmbr of vertex Same nmbr of edges Same degree of corresponding vertex
@amitmauryathecoolcoder267
@amitmauryathecoolcoder267 5 жыл бұрын
Thank you, bhaiya...
@goravchokade1198
@goravchokade1198 5 жыл бұрын
Plz!! Make a video on how to convert an expresion in binary tree..
@reamabdulsalam524
@reamabdulsalam524 2 жыл бұрын
Hello can you please explain everything about graphs from starting to finish I have a subject which call algorithm which I am struggling teacher is bad so please explain everything from zero from the beginning
@nandhushree3914
@nandhushree3914 5 жыл бұрын
PDE sum pls upload sir.your teaching excellence
@govindjangid6201
@govindjangid6201 4 жыл бұрын
Thanks sir ji
@markKebba
@markKebba Жыл бұрын
thanks alot
@Feenaq87667
@Feenaq87667 4 жыл бұрын
Thanks sir
@alambansdancecompany3
@alambansdancecompany3 3 жыл бұрын
Tnx sir
@kassadamitie3351
@kassadamitie3351 5 жыл бұрын
I BOUNDARY SO MUCH
@epicclips8881
@epicclips8881 5 жыл бұрын
Thank u
@letsstudywithme5666
@letsstudywithme5666 2 жыл бұрын
I think aap hindi me or better se explain kr skte the
Number of Spanning trees possible in given Grpah | Kirchoff's Matrix Tree Theorem | Graph Theory #18
9:11
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 39 М.
Euler Graph | Euler Circuit |Graph Theory #16
13:56
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 68 М.
Spanning Tree - Minimum Spanning Tree | Graph Theory #12
13:58
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 141 М.
Eccentricity of a vertex , Radius and Diameter of a Graph with example | Graph Theory #15
12:38
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 37 М.
Classes of Graph (Types of Graph)| Graph Theory #7
8:56
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 89 М.
Biconnected Graph | Graph Theory#22
9:06
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 19 М.
Define Walk , Trail , Circuit , Path and Cycle in a GRAPH | Graph Theory #9
9:13
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 178 М.
Complement of a Graph | Graph Theory #19
4:55
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 20 М.
Tree in data structure - Properties | Graph Theory #10
13:03
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 64 М.
The Dome Paradox: A Loophole in Newton's Laws
22:59
Up and Atom
Рет қаралды 1,1 МЛН
Kruskal's Algorithm for Spanning Tree | Graph Theory #14
22:45
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 36 М.
Degree of a vertex in Graph | Graph Theory #6
6:39
Vivekanand Khyade - Algorithm Every Day
Рет қаралды 189 М.