Eulerian graph: различия между версиями
Перейти к навигации
Перейти к поиску
Glk (обсуждение | вклад) (Новая страница: «'''Eulerian graph''' --- эйлеров граф. A connected undirected graph such that there exists a ''traversal'' of all its edges using each edge exactly once…») |
(нет различий)
|
Текущая версия от 16:01, 21 апреля 2011
Eulerian graph --- эйлеров граф.
A connected undirected graph such that there exists a traversal of all its edges using each edge exactly once (i.e. Eulerian circuit) is called Eulerian. It is well-known that [math]\displaystyle{ G }[/math] is Eulerian (unicursal) if and only if all its vertices have even degree.