Graph Theory Example 1.025 GATE CS 2007 (Eulerian Cycle)

preview_player
Показать описание
Graph Theory problem asked in GATE CS 2007 (Eulerian Cycle)
Рекомендации по теме
Комментарии
Автор

The exact option is c .Because its possible to have a regular graph that may not be connected but an eulerian graph must be connected, .

subbulekshmi