小窓モード

プレミアム

ログイン
設定

設定

「VERTEX」の共起表現一覧(1語右が「of」)

該当件数 : 44



a vertex of a polygon;
a vertex of a polyhedron;
A leaf vertex of a tree in graph theory
For each new vertex of the regular triangle, draw a line from it t
Replace any vertex of the graph by a pair of vertices, each of wh
ly, a charge is assigned to each face and each vertex of the graph.
every vertex of G is mapped to the spine of B; and
Equivalently, p must be a vertex of the convex hull of it and all later points.
A vertex of an angle is the point where two rays or lin
Exactly one vertex of out-degree 0 (no outgoing arcs), called the
The closest vertex of the 16-cell to the viewer projects onto the
In the graph theory tree, a leaf node is a vertex of degree 1 other than the root (except when t
The undirected edges at each vertex of the switch graph may be partitioned into tw
Each vertex of the independent set is adjacent to n vertic
The vertex of maximum degree in T' is the least among all
They are shaped like an inverted "V" with the vertex of the "V" connecting to the clitoral body.
Since the starting vertex of the path is of no importance, the numbers i
The link of a vertex of a tetrahedron is a triangle - the three ver
e photons allows for the reconstruction of the vertex of the decay and is used in the positron emiss
Each vertex of this tessellation is the center of a 5-sphe
Then the triangle formed by joining the vertex of the square distant from both triangles and
directed cubic graph, formed by replacing each vertex of a hypercube graph by a cycle.
The peritoneum is carried by it from the vertex of the bladder on to the abdominal wall to for
The internal angle at each vertex of a regular octagon is 135° and the sum of al
Each vertex of this polytope is the center of a 6-sphere i
an be inscribed in a dodecahedron so that each vertex of the cube is a vertex of the dodecahedron an
n such a way that, for each edge, the starting vertex of the edge has a higher coordinate than the e
tex graph G as assigning O(logn) bits to every vertex of G together with an algorithm to determine w
even component independently, and matching one vertex of an odd component C to a vertex in U and the
that D consists of paths and even cycles (each vertex of D has degree at most two and edges belongin
gh, their momenta, directions, and the primary vertex of the event.
rantees that, when a new pursuer is added to a vertex of the graph, the vertices in β(X) are always
Each vertex of this polytope corresponds to the center of
is an equal parabola, and the generator is the vertex of the rolling parabola which describes the ro
ically, the operation consists in cutting each vertex of the polyhedron with a plane cutting all edg
mpared to the best possible of 240), with each vertex of this polytope represents the center point f
, compared to the best known of 72), with each vertex of this polytope represents the center point f
compared to the best known of 126), with each vertex of this polytope represents the center point f
itely, and win the game, by always moving to a vertex of β(X) where X is the set of vertices that wi
ces that are not the two neighbors of a corner vertex of the grid, then there is only one X-flap and
As can be seen in the illustration, each vertex of the n-dimensional De Bruijn graph correspon
) instant of time s < t on its world-line at a vertex of the null cone connecting the mass and the f
                                                                                                    


こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する
英→日 日→英
こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する

©2024 GRAS Group, Inc.RSS