Eulerian

UK
/ɔɪˈlɪə.ri.ən/
US
/ɔɪˈlɪr.i.ən/
Euleriannoun
Eulerians
множ.
UK
/ɔɪˈlɪəriən/
US
/ɔɪˈlɛriən/
Traductions
эйлеров цикл
An Eulerian cycle is a cycle in a graph that visits every edge exactly once and returns to the starting vertex.
Эйлеров цикл — это цикл в графе, который проходит по каждому ребру ровно один раз и возвращается в начальную вершину.
эйлеров путь
The Eulerian path is a trail in a graph that visits every edge exactly once.
Эйлеров путь — это путь в графе, который проходит по каждому ребру ровно один раз.
Définitions
A path or circuit in a graph that visits every edge exactly once.
The mathematician explained that an Eulerian circuit is possible only if every vertex in the graph has an even degree.
Synonymes
Eulerian graph
Eulerian tour
Eulerian path
Eulerian trail
Eulerian circuit
Eulerianadjective
more Eulerian
Срав.
most Eulerian
Превосх.
UK
/ɔɪˈlɪə.ri.ən/
US
/ɔɪˈlɪr.i.ən/
Traductions
The Eulerian path is a trail in a graph that visits every edge exactly once.
Эйлеров путь — это маршрут в графе, который проходит по каждому ребру ровно один раз.
Définitions
Relating to or characteristic of the Swiss mathematician Leonhard Euler or his work, especially in mathematics and graph theory.
The Eulerian path in the graph was determined by following Euler's principles.
Designating a description or analytical approach in fluid dynamics and continuum mechanics that observes physical properties at fixed points in space rather than tracking individual particles.
In the Eulerian formulation of fluid flow, velocity is expressed as a field that varies with position and time.