「VERTEX」の共起表現一覧(2語右が「is」)
該当件数 : 42件
The | vertex configuration is 3.8/3.8/3. |
The | vertex configuration is 5.5/2.5.5/2. |
The | vertex configuration is 6.5/2.6.5/3. |
The | vertex configuration is 5.6.5/3.6. |
Its | vertex figure is a crossed quadrilateral. |
Its | vertex figure is a rectangular pyramid. |
The | vertex angle is equal to |
Its | vertex figure is a regular octahedron. |
The | vertex figure is a cube. |
This honeycomb's | vertex figure is a tetrakis cube: 24 disphenoids meet |
Its | vertex arrangement is called the D8 lattice. |
Its | vertex arrangement is called the D6 lattice. |
The 222 honeycomb's | vertex arrangement is called the E6 lattice. |
Every | vertex pair is connected by an edge, except opposites |
Its | vertex arrangement is called the D7 lattice. |
The polar sine of the | vertex angle is |
Its | vertex arrangement is called the E7 lattice. |
A | vertex w is said to be adjacent to another vertex v i |
Its | vertex figure is a triangular prism, with 3 icosidode |
The | vertex figure is determined by removing the ringed no |
The | vertex arrangement is also shared with the compounds |
The | vertex figure is a triangular prism, containing two c |
The | vertex figure is determined by removing the ringed no |
The cut surface or | vertex figure is thus a spherical polygon marked on t |
This | vertex arrangement is called the A5 lattice or 5-simp |
The neighborhood of a | vertex v is an induced subgraph of the graph, formed |
treated by using the following gain graph: The | vertex set is {1,2,...,n}. |
Formally, given a graph G, a | vertex labeling is a function mapping vertices of G t |
For example a square | vertex arrangement is understood to mean four points |
Its | vertex figure is an irregular rectangular pyramid, wi |
tational geometry, a Steiner point is an extra | vertex that is not a member of the input. |
ning tree is a spanning tree where the maximum | vertex degree is limited to a certain constant k. |
In geometry, an apex is the | vertex which is in some sense the highest of the figu |
an odd cycle, and a list of Δ colors for each | vertex, it is possible to choose a color for each ver |
f vertices no two of which are adjacent, and a | vertex cover is a set of vertices that includes the e |
subgraphs, the number of colors needed in any | vertex coloring is the same as the number of vertices |
zonohedra are simple (three faces meet at each | vertex), as is the truncated small rhombicuboctahedro |
Its | vertex figure is an elongated 5-cell antiprism, two p |
logue of the) unit interval is the graph whose | vertex set is {0,1} and which contains a single edge |
their normal prescription since the effect of | vertex distance is removed and the effect of center t |
gle becomes understood as representing the new | vertex that is to be added to the simplex represented |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると 検索履歴を保存できる! 語彙力診断の実施回数増加! |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると 検索履歴を保存できる! 語彙力診断の実施回数増加! |