「VERTEX」の共起表現(1語左が「a」) - Weblio英語共起表現検索

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

共起表現

「VERTEX」の共起表現一覧(1語左が「a」)

該当件数 : 68件

the eccentricity of a	vertex, for a given vertex v
a	vertex of a polygon;
a	vertex of a polyhedron;
S is a	vertex separator in G.
For example, a	vertex configuration of (4,6,8) means that a square,
a	vertex configuration and [n,3] Coxeter group symmetry
Wythoffian tessellations can be defined by a	vertex figure.
2-dimensional tilings, they can be given by a	vertex configuration listing the sequence of faces ar
For an undirected graph, the degree of a	vertex is the number of edges incident to the vertex.
semiregular solids can be fully specified by a	vertex configuration, a listing of the faces by numbe
on is thus uniform) it can be represented by a	vertex configuration notation sequencing the faces ar
In other words, a	vertex with a loop "sees" itself as an adjacent verte
Halting at a	vertex vi, there is one unique vertex vj at a distanc
A special case is a loop that connects a	vertex to itself; if such an edge exists, the vertex
For example, a	vertex figure for a polyhedron is a polygon figure, a
For polytopes, a	vertex may map to zero, as depicted below.
Each has a	vertex figure of a {31,n-2,2} polytope is a birectifi
Let NG(v) denote the neighborhood of a	vertex v ∈ V.
Equivalently, p must be a	vertex of the convex hull of it and all later points.
The degree of a	vertex is equal to the number of adjacent vertices.
This set of elements is elsewhere known as a	vertex star.
In mathematics, the polar sine of a	vertex angle of a polytope is defined as follows.
he sides of a triangle that come together at a	vertex form an angle.
In the graph theory tree, a leaf node is a	vertex of degree 1 other than the root (except when t
The neighborhood of a	vertex v is an induced subgraph of the graph, formed
sting the different colors by indices around a	vertex figure.
For an undirected graph, the degree of a	vertex is equal to the number of adjacent vertices.
nsidered, there is only one forbidden minor, a	vertex with two loops.
Formally, given a graph G, a	vertex labeling is a function mapping vertices of G t
The problems of finding a	vertex disjoint and edge disjoint cycle covers with m
} is composed of 3 coplanar pentagons around a	vertex and two perpendicular pentagons filling the ga
The link of a	vertex of a tetrahedron is a triangle - the three ver
Given a	vertex v and an edge label i, the rotation map return
If the two removed edges meet at a	vertex, as in Figure B, the remaining graph contains
ach form; a mirror is active with respect to a	vertex that does not lie on it.
loop or a "buckle") is an edge that connects a	vertex to itself.
notes the number of k-faces in the polytope (a	vertex is a 0-face, an edge is a 1-face, etc.).
nce around the boundary of the triangle from a	vertex to the point on the opposite edge touched by a
x and 2k-1,1 (n-1)-polytope facets, each has a	vertex figure as an (n-1)-demicube, {31,n-2,1}.
ation, for each non-isolated v ∈ V, there is a	vertex u ∈ U with {u, v} ∈ E and c(u) ≠ c(v).
dian of a triangle is a line segment joining a	vertex to the midpoint of the opposing side.
Since a	vertex with a loop could never be properly colored, i
A complete bipartite graph Km,n has a	vertex covering number of min{m,n} and an edge coveri
hich also has 3 triangles and two squares on a	vertex, but in a different order.
dra and tetrahedra can be alternated to form a	vertex, edge, and face-uniform tessellation of space,
vertices such that each color class induces a	vertex disjoint union of cliques.
increase the number of edges in G by moving a	vertex from part A to part B. By moving a vertex from
s; these properties are used in rendering by a	vertex shader, part of the vertex pipeline.
borescence is a directed graph in which, for a	vertex u called the root and any other vertex v, ther
f vertices no two of which are adjacent, and a	vertex cover is a set of vertices that includes the e
In modern terms, the defect at a	vertex or over a triangle (with a minus) is precisely
depth first search whenever the loop reaches a	vertex that has not already been included in a previo
same two distinct vertices, no edge connects a	vertex to itself, and the graph is connected.
matching in the grid graph formed by placing a	vertex at the center of each square of the region and
harmonious coloring in the sense that it is a	vertex coloring in which every pair of colors appears
rantees that, when a new pursuer is added to a	vertex of the graph, the vertices in β(X) are always
In mathematics, a	vertex cycle cover (commonly called simply cycle cove
s, while the word loop is an edge connecting a	vertex with itself) correspond to the quantum correct
nstance to one-in-three SAT as a graph, with a	vertex for each variable and each clause, and an edge
itely, and win the game, by always moving to a	vertex of β(X) where X is the set of vertices that wi
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.
) instant of time s < t on its world-line at a	vertex of the null cone connecting the mass and the f
t (S, ≤) one represents each element of S as a	vertex in the plane and draws a line segment or curve
he opposite sides of the cube, and a loop at a	vertex if the opposite sides have the same color.
First, a distance sequence from a	vertex v in a graph is the sequence n1, n2, n3, ...,

共起表現の隣合う単語の集計結果ページに戻る

意味

例文

類語

共起表現