Примеры использования Two edges на Английском языке и их переводы на Русский язык
{-}
-
Official
-
Colloquial
cd are two edges in the same queue, then it should
That is, the curve representing each edge should have the property that every horizontal line intersects it in at most one point, and no two edges may intersect except at a shared endpoint.
pathwidth p can be embedded into a three-dimensional grid of size p× p× n in such a way that no two edges(represented as straight line segments between grid points)
a set of edges each of which connects a vertex in U to a vertex in V. No two edges can both connect the same pair of vertices.
the same out-degree d, and in which the edges are d-colored in such a way that every two edges with the same source vertex have distinct colors.
Richter(2011) considers the problem of finding a graph drawing of a given cubic graph with the properties that all of the edges in the drawing have one of three different slopes and that no two edges lie on the same line as each other.
Kelmans(1994) showed that Barnette's conjecture is equivalent to a superficially stronger statement, that for every two edges e and f on the same face of a bipartite cubic polyhedron,
For instance, the property of having a Hamiltonian cycle may be expressed in MSO2 by describing the cycle as a set of edges that includes exactly two edges incident to each vertex,
can be subdivided into two edges, e1 and e2,
for which corresponding vertices has the same degrees(numbers of incident edges) and two edges having corresponding ends and the same numbers in these ends,
Each of two edge resonators is coupled with one neighbor resonator
Above, we made sure that the Origin server receives a video stream and replicates it to two Edge servers.
its edges as curves that connect these points, such that no two edge curves cross each other
The possibility of feeding two edges and their automatic replacement.
is connected to e by two edges.
there is a maximum distance δ from a point on an edge to one of the other two edges.
The top two edges in the inner cycle must be chosen,
Each vertex of the polar graph corresponds to two vertices of the skew-symmetric graph, and each edge of the polar graph corresponds to two edges of the skew-symmetric graph.
At most one of these two edges can be present in H,
Barycentric subdivision is an example of a subdivision rule with one edge type(that gets subdivided into two edges) and one tile type a triangle that gets subdivided into 6 smaller triangles.