Euler and Hamiltonian Graph Problem - Graph Theory - Discrete Mathematics

preview_player
Показать описание
Subject - Discrete Mathematics

Video Name - Euler and Hamiltonian Graph Problem

Chapter - Graph Theory

Faculty - Prof. Farhan Meer

Upskill and get Placements with Ekeeda Career Tracks

Get FREE Trial for GATE 2023 Exam with Ekeeda GATE - 20000+ Lectures & Notes, strategy, updates, and notifications which will help you to crack your GATE exam.
Coupon Code - EKGATE

Get Free Notes of All Engineering Subjects & Technology

Happy Learning

Social Links:

#GraphTheory #DiscreteMathematics
Рекомендации по теме
Комментарии
Автор

Thank you sir .. I got to understand very well..❤

rohankumarpandit
Автор

For example 1 you didn’t label and visit the middle vertex. The are five vertices there not four

tshwareloshabalala
Автор

Draw two graphs each with 10 vertices and 13 edges: one that is Eulerian but not Hamiltonian and
one that is Hamiltonian but not Eulerian.

DersoZelalem
Автор

for example 2 (eulerian but not Hamiltonian )you visited C twice for the closed Euler path

meronasmerom
Автор

sir your intro is very irritating .its too noisy.all though your explanation is great

rishav