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

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

意味

例文

類語

共起表現

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

該当件数 : 664件

＜前へ 1 2 3 4 次へ＞

which has one square and two octagons at each	vertex.
es, of which three, four, or five meet at each	vertex.
There is one square and two octagons on each	vertex.
having an even number of faces meeting at each	vertex.
free Hasse diagram in which the height of each	vertex is proportional to its rank.
ically, the operation consists in cutting each	vertex of the polyhedron with a plane cutting all edg
Each	vertex has exactly m incoming and m outgoing edges.
simultaneously computes the distances to each	vertex t in the graphs Gt, it is also possible to fin
one triangle and two tetrakaidecagons on each	vertex.
re are three triangles and two squares on each	vertex.
mpared to the best possible of 240), with each	vertex of this polytope represents the center point f
ne a cevian of an n-simplex as a ray from each	vertex to a point on the opposite (n-1)-face (facet).
is a type of an intersection graph, where each	vertex is represented as a polygon and each edge as a
s an undirected edge-labeled graph, where each	vertex enumerates its outgoing neighbors.
, compared to the best known of 72), with each	vertex of this polytope represents the center point f
uare pyramid is convex and the defects at each	vertex are each positive.
cy graph, which is a directed graph where each	vertex is an instruction and there is an edge from I1
other words, a graph is semi-symmetric if each	vertex has the same number of incident edges, and the
here are two hexagons and one heptagon on each	vertex, forming a pattern similar to a conventional s
ation ordering of the graph and that, for each	vertex v, forms a clique for v and its later neighbor
compared to the best known of 126), with each	vertex of this polytope represents the center point f
G as a switch graph in which the edges at each	vertex are partitioned into matched and unmatched edg
Each	vertex v contains the coordinates of the vertex and a
Each	vertex of this tessellation is the center of a 5-sphe
ls, five 5-cells, and one 16-cell meet at each	vertex, but the vertex figures have different symmetr
For each	vertex v, add v to a level that is at least one step
trongly connected if there is a path from each	vertex in the graph to every other vertex.
entagons), with five pentagons meeting at each	vertex, intersecting each other making a pentagrammic
polytope Kn is a convex polytope in which each	vertex corresponds to a way of correctly inserting op
knight chess piece on a chessboard where each	vertex represents a square on a chessboard and each e
from L one of the leaves associated with each	vertex in K.
c graph in which the nodes reachable from each	vertex form a tree (or equivalently, if G is a direct
er pentagon and an inner five-point star, each	vertex on one side of the partition has exactly one n
t elimination ordering, form a clique for each	vertex v together with the neighbors of v that are la
Because G is triangular, the degree of each	vertex in a configuration is known, and all edges int
minus the sum of the outgoing numbers at each	vertex is divisible by four.
c faces, with three pentagrams meeting at each	vertex.
obtained by adding extra triangles around each	vertex.
round each edge, and 8 dodecahedra around each	vertex in an octahedral arrangement.
t cycles, then every shortest path visits each	vertex at most once, so at step 3 no further improvem
Thus the interior angle at each	vertex is either 90° or 270°.
As can be seen in the illustration, each	vertex of the n-dimensional De Bruijn graph correspon
uare and one hexagon and one dodecagon at each	vertex.
directed cubic graph, formed by replacing each	vertex of a hypercube graph by a cycle.
aph (that is, a polyhedral graph in which each	vertex is incident to exactly three edges) has a Hami
e the number of orientations of such that each	vertex has two inwardly directed and two outwardly di
cover of G has two vertices ui and wi for each	vertex vi of G. Two vertices ui and wj are connected
In the illustration, each	vertex in the tensor product is shown using a color f
Interval graphs have this representation: each	vertex stores the endpoints of the intervals and the
The internal angle at each	vertex of a regular octagon is 135° and the sum of al
ymmetric matrix with a row and column for each	vertex, having 0 on the diagonal and, in the position
case, a DCEL contains a record for each edge,	vertex and face of the subdivision.
the necessary repetition of the start and end	vertex is a simple cycle.
a simple graph with n vertices in which every	vertex is adjacent to every other.
every	vertex of G is mapped to the spine of B; and
It is a cubic graph: every	vertex touches exactly three edges.
ertices in S is connected by an edge and every	vertex not in S is missing an edge to at least one ve
tex graph G as assigning O(logn) bits to every	vertex of G together with an algorithm to determine w
in a Cn equals the number of edges, and every	vertex has degree 2; that is, every vertex has exactl
ng the edges of a dodecahedron such that every	vertex is visited a single time, no edge is visited t
ample, let G o be G with a loop added to every	vertex.
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.
Every	vertex pair is connected by an edge, except opposites
rfect graphs (in every induced subgraph, every	vertex belongs to an independent set meeting all maxi
compiler can construct a graph such that every	vertex represents a unique variable in the program.
Joining by an edge every	vertex labeled i to every vertex labeled j (denoted n
of edges of G that form a tree spanning every	vertex.
If every	vertex in an n-vertex graph has degree at least n/2 +
th cover, i.e., a set of paths such that every	vertex v ∈ V belongs to exactly one path.
δ(G) ≥ k - 1, that is, every	vertex is adjacent to at least k - 1 others.
total will have one complete circle for every	vertex in the polyhedron.
That is, every	vertex lies in the tree, but no cycles (or loops) are
With an even number of faces at every	vertex, these polyhedra and tilings can be shown by a
For, when every	vertex other than v is colored, it has an uncolored p
section representation of a graph labels every	vertex with a set so that vertices are adjacent if an
ces in a graph is said to be a module if every	vertex in A has the same set of neighbors outside of
An external	vertex is colored with the field label of its inciden
tational geometry, a Steiner point is an extra	vertex that is not a member of the input.
blem of finding the size of a minimum feedback	vertex set can be solved in time O(1.7347n),
. Razgon : Computing Minimum Directed Feedback	Vertex Set in O*(1.9977n).
Furthermore, the feedback	vertex set problem has applications in VLSI chip desi
oneycombs with all finite facets, and a finite	vertex figure.
oneycombs with all finite facets, and a finite	vertex figure.
oneycombs with all finite facets, and a finite	vertex figure.
on scattering has the advantage that the first	vertex can be cleanly described by the well known qua
are trees directed towards the root at a fixed	vertex w in G.
The terminology of using colors for	vertex labels goes back to map coloring.
Four years later, he founded	Vertex Academic Services, a test preparation provider
he end of the video clip, going clockwise from	vertex 1, is 1, 2, 5, 4, 3, 7, 6, 5, 2, 7, 3, 4, 5, 6
If segments of lengths p and q emanating from	vertex C trisect the hypotenuse into segments of leng
Twenty-four 16-cells meet at any given	vertex in this tessellation.
computes the shortest path tree, from a given	vertex.
shining greyish ochreous with greenish gloss,	vertex, neck tufts and collar greyish brown; labial p
t is, the number of trees for which each graph	vertex (not counting the root) is adjacent to no more
This honeycomb's	vertex figure is a tetrakis cube: 24 disphenoids meet
The 222 honeycomb's	vertex arrangement is called the E6 lattice.
hooses a permutation connecting each hypercube	vertex to another vertex with which it should be conn
thm that finds a shortest path from an initial	vertex to a goal vertex in a directed graph.
// input	vertex
rongly, every strongly connected tournament is	vertex pancyclic: for each vertex v, and each k in th
Like the Kneser graph it is	vertex transitive with degree .
If there is no isolated	vertex in the graph (that is, δ ≥ 1), then the domati
An isolated	vertex has no adjacent vertices.
ure of a neutral current event was an isolated	vertex from which only hadrons were produced.
tance, this may be achieved by placing the ith	vertex at the point (i,i2,i3) of the moment curve.
It shares its	vertex arrangement with the truncated great dodecahed
Its	vertex figure alternates two regular pentagons and de
It shares its	vertex arrangement with the great stellated truncated
It shares its	vertex arrangement with the uniform compounds of 10 o
Its	vertex figure is an elongated 5-cell antiprism, two p
It shares its	vertex arrangement with the regular dodecahedron, as
It shares its	vertex arrangement with the truncated great dodecahed
Its	vertex figure is a crossed quadrilateral.
Its	vertex figure is a rectangular pyramid.
It shares its	vertex arrangement with three nonconvex uniform polyh
Its	vertex figure is a regular octahedron.
to version 2.1, and uses LLVM to increase its	vertex processing speed.
It shares its	vertex arrangement with the truncated dodecahedron.
Its	vertex arrangement is called the D8 lattice.
Its	vertex arrangement is called the D6 lattice.
Its	vertex arrangement is called the D7 lattice.
those in which one arrow points away from its	vertex and towards the opposite end, while the other
Its	vertex arrangement is called the E7 lattice.
Its	vertex figure is a triangular prism, with 3 icosidode
Its	vertex figure 6.10/3.6/5.10/7 is also ambiguous, havi
A graph is said to be k-varigated if its	vertex set can be partitioned into k equal parts such
Its	vertex figure is an irregular rectangular pyramid, wi
It shares its	vertex arrangement with the compound of 6 pentagrammi
space, usually approximately conical with its	vertex at the antenna, that cannot be scanned by an a
possible graph G (in terms of the size of its	vertex set V) of diameter k such that the largest deg
o, Gilson, Corning, VistaLab, Thermo, Jencons,	Vertex, Handypett, and Pricisexx.
Below is the table of the best known	vertex transitive digraphs (as of October 2008) in th
A leaf	vertex of a tree in graph theory
It cannot go in one lower	vertex and out the other.
ning tree is a spanning tree where the maximum	vertex degree is limited to a certain constant k.
Head: frons shining pale golden metallic,	vertex and neck tufts shining dark bronze brown with
he theorem states that the size of the minimum	vertex cut for x and y (the minimum number of vertice
-Ford algorithm is used, starting from the new	vertex q, to find for each vertex v the least weight
At the center is shown the new	vertex q, a shortest path tree as computed by the Bel
Creation of a new	vertex v with label i ( noted i(v) )
e the multigraph formed by adding a single new	vertex v in the unbounded face of G, and connecting v
For each new	vertex of the regular triangle, draw a line from it t
gle becomes understood as representing the new	vertex that is to be added to the simplex represented
This new	vertex is joined to every element in the original sim
two vertices embedded to the same point and no	vertex embedded into a point within an edge.
red denotes a non-principal	vertex, green denotes an ear and blue denotes a mouth
g the algebraic property of being edge but not	vertex transitive (see below).
Head: frons shining pale ochreous,	vertex and neck tufts shining greyish brown, laterall
Head: frons shining pale ochreous,	vertex and neck tufts shining ochreous-brown, mediall
Head: frons shining ochreous-grey,	vertex and neck tufts shining dark brown with a media
Head: frons shining ochreous-white,	vertex dark brown with reddish gloss, laterally and m
Head: frons ochreous-white,	vertex, neck tufts and collar dark brown with reddish
Head: frons shining ochreous-white,	vertex and neck tufts shining greyish brown with some
Head: frons shining ochreous-white,	vertex, neck tufts and collar shining pale bronze bro
Head: frons shining ochreous-white;	vertex shining bronze brown with reddish gloss, later
Both have an octahedral	vertex figure, replacing the cubic cells by dodecahed
with one endpoint has only a single odd-degree	vertex rather than having an even number of such vert
w-symmetric directed graph G(V, E) composed of	vertex set V and directed edge set E. Each vertex in
The algorithm finds a maximal set of	vertex disjoint augmenting paths of length k.
re must contain equal numbers of both types of	vertex and must have an even length.
In particular he invented the notion of	vertex algebras, which Igor Frenkel, James Lepowsky a
An isogonal polyhedron has a single kind of	vertex figure.
Corporation, Xanatos demands vast supplies of	Vertex, an expensive crystal worth high monetary valu
their normal prescription since the effect of	vertex distance is removed and the effect of center t
A graph with a loop on	vertex 1
Exactly one	vertex of out-degree 0 (no outgoing arcs), called the
s and directed edges, each edge connecting one	vertex to another, such that there is no way to start
even component independently, and matching one	vertex of an odd component C to a vertex in U and the
The simplex graph has one	vertex for every simplex in the clique complex X(G) o
form the clique graph, as is every set of one	vertex and every set of two adjacent vertices.
n 1 to n dots, overlaid so that they share one	vertex.
ph G, one may form a switch graph that has one	vertex for every corresponding pair of vertices in G
as a single fan, by arbitrarily selecting one	vertex as the center.
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
the three paths between them have exactly one	vertex in common.
ollapsed into a point, losing one edge and one	vertex, and changing two squares into triangles.
Given a CW complex S containing one	vertex, one edge, one face, and generally exactly one
ny cell complex C is a flag complex having one	vertex per cell of C. A collection of vertices of the
The Desargues graph has one	vertex for each point, one vertex for each line, and
t matching (a matching that covers all but one	vertex in a graph with an odd number of vertices).
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
pe formed by joining two triangles at just one	vertex is not a proper polyabolo.
of a graph such that there exists exactly one	vertex for which all adjoining edges are oriented inw
or monogon) is a polygon with one edge and one	vertex.
They are maximally connected as the only	vertex cut which disconnects the graph is the complet
or of selection is a linear process where only	vertex i-1 can replace vertex i (but not the other wa
lling in new faces in the gaps for each opened	vertex and edge.
lling in new faces in the gaps for each opened	vertex and edge.
side resting on the Guadiana and the opposite	vertex entering south-east and surrounded by Spanish
each such point of tangency with its opposite	vertex by a line (shown red in the figure), these thr
perpendicular onto this side from the opposite	vertex falls inside this segment.
The cut surface or	vertex figure is thus a spherical polygon marked on t
ected polyhedra, for example, where an edge or	vertex is shared by more than two faces (e.g. as in e
quiring no arbitrary choice of side as base or	vertex as origin.
contracting any edge, or removing any edge or	vertex, leads to another apex graph.

＜前へ 1 2 3 4 次へ＞

共起表現

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

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