「vertex」の共起表現(1語右で並び替え)2ページ目

Weblio 辞書 > 英和辞典・和英辞典 > vertexの意味・解説 > vertexに関連した共起表現

意味

例文

類語

共起表現

「vertex」の共起表現一覧(1語右で並び替え)2ページ目

該当件数 : 601件

＜前へ 1 2 3 4 次へ＞

Avis proposed a criss-cross algorithm for the	vertex enumeration problem; their algorithm counts al
cle (a cycle of edges that passes through each	vertex exactly once).
perpendicular onto this side from the opposite	vertex falls inside this segment.
The rectified 10-orthoplex is the	vertex figure for the demidekeractic honeycomb.
The	vertex figure is determined by removing the ringed no
This polytope is the	vertex figure for a uniform tessellation of 6-dimensi
Its	vertex figure alternates two regular pentagons and de
A	vertex figure for an n-polytope is an (n-1)-polytope.
The cut surface or	vertex figure is thus a spherical polygon marked on t
It is the also the	vertex figure of the 5-simplex honeycomb.
The tridiminished icosahedron is the	vertex figure of the snub 24-cell, a uniform polychor
Its	vertex figure is an elongated 5-cell antiprism, two p
is part of sequence of snubbed polyhedra with	vertex figure (3.3.3.3.p) and Coxeter-Dynkin diagram
The	vertex figure can be seen topologically as a modified
Its	vertex figure is a crossed quadrilateral.
Its	vertex figure is a rectangular pyramid.
y part of sequence of rectified polyhedra with	vertex figure (3.n.3.n) and (*n32) reflectional symme
Its	vertex figure is a regular octahedron.
The	vertex figure is a cube.
part of sequence of polyhedra and tilings with	vertex figure (3.2n.3.2n) and (*n33) reflectional sym
This honeycomb's	vertex figure is a tetrakis cube: 24 disphenoids meet
The	vertex figure of the grand antiprism is a dissected r
The edge figure is the	vertex figure of the vertex figure.
sequence of regular polyhedra and tilings with	vertex figure (4n).
determined by removing the ringed nodes of the	vertex figure and ringing the neighboring node.
The	vertex figure has 8 vertices and 12 5-cells.
(The actual	vertex figure of the THHH is 3.4.3/2.4,
This polytope is the	vertex figure of the 9-demicube, and the edge figure
This polytope is the	vertex figure for the 162 honeycomb.
The edge figure is the	vertex figure of the vertex figure, here being a bire
Its	vertex figure is a triangular prism, with 3 icosidode
The	vertex figure for a regular 4-polytope {p,q,r} is an
Its	vertex figure 6.10/3.6/5.10/7 is also ambiguous, havi
Its	vertex figure is an irregular rectangular pyramid, wi
rm polyhedrons, where dv is the density of the	vertex figure and df is the density of the face and D
For example, a	vertex figure for a polyhedron is a polygon figure, a
edron, which accordingly has the same abstract	vertex figure (2 triangles and two squares: 3.4.3.4)
The	vertex figure is determined by removing the ringed no
The birectified 5-simplex is the	vertex figure for the 6 dimensional 122 polytope.
The rectified hexacross is the	vertex figure for the demihexeractic honeycomb.
x and 2k-1,1 (n-1)-polytope facets, each has a	vertex figure as an (n-1)-demicube, {31,n-2,1}.
It is defined by an irregular decachoron	vertex figure (10-celled 4-polytope), faceted by four
The	vertex figure of the uniform polyhedron, great dirhom
The	vertex figure is a triangular prism, containing two c
Each has a	vertex figure of a {31,n-2,2} polytope is a birectifi
on may be found from the original polyhedron's	vertex figure using the Dorman Luke construction.
Related to the	vertex figure, an edge figure is the vertex figure of
ic honeycomb t0,1{4,3,4}, has a square pyramid	vertex figure, with truncated cube and octahedron cel
property of a uniform figure which has n types	vertex figure, that are collectively vertex transitiv
Both have an octahedral	vertex figure, replacing the cubic cells by dodecahed
nd 8-simplex facets arranged in a demiocteract	vertex figure.
oneycombs with all finite facets, and a finite	vertex figure.
sting the different colors by indices around a	vertex figure.
It has a 24-cell	vertex figure.
An isogonal polyhedron has a single kind of	vertex figure.
Wythoffian tessellations can be defined by a	vertex figure.
oneycombs with all finite facets, and a finite	vertex figure.
oneycombs with all finite facets, and a finite	vertex figure.
	Vertex figure: triangular prism
	Vertex figure: Triangular orthobicupola
All the solid angles and	vertex figures of a disphenoid are the same.
ontain either star polygon faces, star polygon	vertex figures or both.
Their	vertex figures are skew polygons, zig-zagging between
general an n-dimensional uniform tessellation	vertex figures are define by an (n-1)-polytope with e
The sequence has two	vertex figures (n.6.6) and (6,6,6).
They have Wythoff symbol p q r \| and	vertex figures as 2p.2q.2r.
imensions, made of uniform polytope facets and	vertex figures, defined by all permutations of rings
ations, vertical projected views of their skew	vertex figures, and partial corresponding uniform hon
can be constructed from a number of different	vertex figures.
The simplex graph has one	vertex for every simplex in the clique complex X(G) o
ph G, one may form a switch graph that has one	vertex for every corresponding pair of vertices in G
the eccentricity of a	vertex, for a given vertex v
The Desargues graph has one	vertex for each point, one vertex for each line, and
nstance to one-in-three SAT as a graph, with a	vertex for each variable and each clause, and an edge
ph; both parts of the bipartite graph have one	vertex for each vertex of G.
It has one	vertex for each arc in the set, and an edge between e
of a graph such that there exists exactly one	vertex for which all adjoining edges are oriented inw
a given planar graph G is a graph which has a	vertex for each plane region of G, and an edge for ea
a universal graph may be constructed having a	vertex for every possible label.
he sides of a triangle that come together at a	vertex form an angle.
ally hexagonal; that is, the neighbors of each	vertex form a cycle of six vertices.
c graph in which the nodes reachable from each	vertex form a tree (or equivalently, if G is a direct
here are two hexagons and one heptagon on each	vertex, forming a pattern similar to a conventional s
e tree is oriented consistently away from some	vertex forms a subclass of distance-hereditary graphs
A Swastika (standing on the	vertex) framed by a quadrat.
increase the number of edges in G by moving a	vertex from part A to part B. By moving a vertex from
Therefore, removing one	vertex from each short cycle leaves a smaller graph w
pendent set I such that I contains exactly one	vertex from each path in P. Dilworth's theorem follow
ure of a neutral current event was an isolated	vertex from which only hadrons were produced.
A	vertex function fi for each vertex i.
studied over regular graphs or grids, and the	vertex functions are typically assumed to be identica
oduce the Y-local maps Fi constructed from the	vertex functions by
governed by the properties of the graph Y, the	vertex functions (fi)i, and the update sequence w.
ifting again, so the hyperplane intersects the	vertex, gives another rhombic dodecahedral honeycomb
red denotes a non-principal	vertex, green denotes an ear and blue denotes a mouth
o, Gilson, Corning, VistaLab, Thermo, Jencons,	Vertex, Handypett, and Pricisexx.
In the plane, each	vertex has on average six surrounding triangles.
in a Cn equals the number of edges, and every	vertex has degree 2; that is, every vertex has exactl
)-graph is defined to be a graph in which each	vertex has exactly r neighbors, and in which the shor
An isolated	vertex has no adjacent vertices.
h of a simple polyhedron if it is cubic (every	vertex has three edges), and it is the graph of a sim
of its vertices with k colours such that each	vertex has at most d neighbours having the same colou
special case of a pseudoforest in which every	vertex has outdegree exactly 1.
d graph is a pseudoforest if and only if every	vertex has outdegree at most 1.
Each	vertex has exactly m incoming and m outgoing edges.
other words, a graph is semi-symmetric if each	vertex has the same number of incident edges, and the
This graph is strongly regular; any	vertex has 16 neighbors, any 2 adjacent vertices have
e the number of orientations of such that each	vertex has two inwardly directed and two outwardly di
ymmetric matrix with a row and column for each	vertex, having 0 on the diagonal and, in the position
or of selection is a linear process where only	vertex i-1 can replace vertex i (but not the other wa
he opposite sides of the cube, and a loop at a	vertex if the opposite sides have the same color.
g that of the parallelotope whose edges at the	vertex in question are the given vectors v1, ..., vn.
the depth of each	vertex in the depth-first-search tree (once it gets v
If there is no isolated	vertex in the graph (that is, δ ≥ 1), then the domati
Twenty-four 16-cells meet at any given	vertex in this tessellation.
oms business, Your Communications in 2006, and	Vertex in March 2007.
e largest distance of any point to its closest	vertex in the k-set is minimum.
s, mp(G) is equal to the minimum degree of any	vertex in the graph, because deleting all edges incid
the three paths between them have exactly one	vertex in common.
, ..., vn, n ≥ 2, be non-zero vectors from the	vertex in the directions of the edges.
r faces, having five triangles meeting at each	vertex in a pentagrammic sequence.
is a network having a value of flow of 7. The	vertex in white and the vertices in grey form the sub
If every	vertex in an n-vertex graph has degree at least n/2 +
by, at each step, choosing the minimum degree	vertex in the graph and removing its neighbors achiev
t matching (a matching that covers all but one	vertex in a graph with an odd number of vertices).
trongly connected if there is a path from each	vertex in the graph to every other vertex.
from L one of the leaves associated with each	vertex in K.
The apex of urinary bladder (	vertex in older texts) is directed forward toward the
Because G is triangular, the degree of each	vertex in a configuration is known, and all edges int
The neighborhood of any	vertex in a distance-hereditary graph is a cograph.
total will have one complete circle for every	vertex in the polyhedron.
allowed to follow edges that lead to an unused	vertex in the previous layer, and paths in the depth
round each edge, and 8 dodecahedra around each	vertex in an octahedral arrangement.
In the illustration, each	vertex in the tensor product is shown using a color f
t (S, ≤) one represents each element of S as a	vertex in the plane and draws a line segment or curve
ces in a graph is said to be a module if every	vertex in A has the same set of neighbors outside of
This essentially means that for each unmatched	vertex in L, we add into T all vertices that occur in
entagons), with five pentagons meeting at each	vertex, intersecting each other making a pentagrammic
a simple graph with n vertices in which every	vertex is adjacent to every other.
The degree of a	vertex is equal to the number of adjacent vertices.
Note that only one additional	vertex is needed to draw the second triangle.
ected polyhedra, for example, where an edge or	vertex is shared by more than two faces (e.g. as in e
e graph, this surface is a torus in which each	vertex is surrounded by six triangles.
ng the edges of a dodecahedron such that every	vertex is visited a single time, no edge is visited t
re exactly the block graphs in which every cut	vertex is incident to at most two blocks, or equivale
use if a particular path from the root to some	vertex is minimal, then any part of that path (from n
For an undirected graph, the degree of a	vertex is equal to the number of adjacent vertices.
A	vertex is a corner point of a polygon, polyhedron, or
Specifically, a cut	vertex is any vertex that when removed increases the
mbedded on a flat plane in space, and the apex	vertex is placed above the plane and connected to it
Check if the current	vertex is the goal state
free Hasse diagram in which the height of each	vertex is proportional to its rank.
the necessary repetition of the start and end	vertex is a simple cycle.
is a type of an intersection graph, where each	vertex is represented as a polygon and each edge as a
For an undirected graph, the degree of a	vertex is the number of edges incident to the vertex.
nt and one of the vertices of the polygon; the	vertex is chosen at random in each iteration.
cy graph, which is a directed graph where each	vertex is an instruction and there is an edge from I1
A cut	vertex is a vertex the removal of which would disconn
An external	vertex is colored with the field label of its inciden
notes the number of k-faces in the polytope (a	vertex is a 0-face, an edge is a 1-face, etc.).
δ(G) ≥ k - 1, that is, every	vertex is adjacent to at least k - 1 others.
pe formed by joining two triangles at just one	vertex is not a proper polyabolo.
No matter which	vertex is added to X to form Y, there will be a Y-fla
minus the sum of the outgoing numbers at each	vertex is divisible by four.
Thus the interior angle at each	vertex is either 90° or 270°.
aph (that is, a polyhedral graph in which each	vertex is incident to exactly three edges) has a Hami
This new	vertex is joined to every element in the original sim
an odd cycle, and a list of Δ colors for each	vertex, it is possible to choose a color for each ver
Joining by an edge every	vertex labeled i to every vertex labeled j (denoted n
Formally, given a graph G, a	vertex labeling is a function mapping vertices of G t
While the adjacency matrix depends on the	vertex labeling, its spectrum is a graph invariant.
The terminology of using colors for	vertex labels goes back to map coloring.
	Vertex labels are in black, edge labels in red
aph in terms of the minimum number of distinct	vertex labels needed to build up the graph from disjo
contracting any edge, or removing any edge or	vertex, leads to another apex graph.
That is, every	vertex lies in the tree, but no cycles (or loops) are
The choice of which	vertex lies at zero is arbitrary with the alternative
Head: frons shining yellowish white,	vertex light brown, neck tufts brown, medially and la
al hexagons, and new triangles at the original	vertex locations.
irst (RICH-1) is located immediately after the	Vertex Locator (VELO) around the interaction point an
For polytopes, a	vertex may map to zero, as depicted below.
e Discharging Phase the charge at each face or	vertex may be redistributed to nearby faces and verti
And if v itself is removed, any other	vertex may be chosen as the apex.
e in which the only crossings involve the apex	vertex, minimizing the total number of crossings, in
Head: frons ochreous-white,	vertex, neck tufts and collar dark brown with reddish
g white with greenish and reddish reflections,	vertex neck tufts and collar shining olive brown with
shining greyish ochreous with greenish gloss,	vertex, neck tufts and collar greyish brown; labial p
Head: frons shining ochreous-white,	vertex, neck tufts and collar shining pale bronze bro
The henagonal henahedron consists of a single	vertex, no edges and a single face (the whole sphere
ertices in S is connected by an edge and every	vertex not in S is missing an edge to at least one ve
A graph with 6 vertices and 7 edges where the	vertex number 6 on the far-left is a leaf vertex or a
Below is the table of the	vertex numbers for the best-known graphs (as of Octob
lar (cubic) simple graphs are listed for small	vertex numbers.
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

＜前へ 1 2 3 4 次へ＞

共起表現

「vertex」の共起表現(1語右で並び替え)2ページ目 - Weblio英語共起表現検索

「vertex」の共起表現一覧(1語右で並び替え)2ページ目