WHAT IS PERFECT GRAPH _WITH EXAMPLE IN GRAPH THEORY

preview_player
Показать описание
WHAT IS PERFECT GRAPH _WITH EXAMPLE IN GRAPH THEORY
Рекомендации по теме
Комментарии
Автор

clique number is 5 since there is a k5 subgraph. chromatic no is also 5 since vertex E and F are having degree 5. isnt it?

PRINCEABRAHAMCSE
Автор

Please discuss the proof : perfect graph theorem statements are equivalent

dipanwitagoswami
Автор

CDEA me all 4 vertices are connected hence max clique no. is 4 not 3 and CDEA me 4 colors use honge bcz vo complete sub graph hai, concepts hi galat padha rakhe hai tumne

devkumar
Автор

Thanks it really did help me in understanding 🤗😁

DarkGamer
visit shbcf.ru