aof.sorular.net
Mathematics 2
Mathematics 2 Deneme Sınavı
Mathematics 2 Deneme Sınavı Sorusu #487247
Mathematics 2 Deneme Sınavı Sorusu #487247
Which one is an Eulerian walk in the following graph?
|
e→d→b→c→a |
|
d→b→c→d→a→e |
|
a→e→d→c→e→b |
|
e→d→c→a→d→b→c |
|
b→d→a→e→d→a→c→b |
Yanıt Açıklaması:
An Eulerian walk is a walk that goes through every edge exactly once (the walk may or may not be closed). Since the walk e→d→c→a→d→b→c goes through every edge exactly once, it is an Eulerian walk. The correct answer is D.
Yorumlar
- 0 Yorum