「VERTEX」の共起表現(2語右で並び替え)

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

意味

例文

類語

共起表現

「VERTEX」の共起表現一覧(2語右で並び替え)

該当件数 : 566件

1 2 3 次へ＞

n particular, the graph consisting of a single	vertex with a loop corresponds to a set which contain
At the center is shown the new	vertex q, a shortest path tree as computed by the Bel
raph if there are a real number S and for each	vertex v a real vertex weight w(v) such that for any
Petersen and Coxeter graphs by replacing each	vertex with a triangle.
of the rook chess piece on a chessboard: each	vertex represents a square on a chessboard and each e
e triangulations of a point set, in which each	vertex represents a triangulation and two triangulati
the link can be visualized by cutting off the	vertex with a plane; formally, intersecting the tetra
each such point of tangency with its opposite	vertex by a line (shown red in the figure), these thr
Thus, each successive	vertex on a shortest path between two vertices of Wuv
ally hexagonal; that is, the neighbors of each	vertex form a cycle of six vertices.
he king chess piece on a chessboard where each	vertex represents a square on a chessboard and each e
the eccentricity of a	vertex, for a given vertex v
a	vertex of a polygon;
a	vertex of a polyhedron;
A	vertex is a corner point of a polygon, polyhedron, or
r faces, having five triangles meeting at each	vertex in a pentagrammic sequence.
compiler can construct a graph such that every	vertex represents a unique variable in the program.
the necessary repetition of the start and end	vertex is a simple cycle.
The link of a	vertex of a tetrahedron is a triangle - the three ver
A leaf	vertex of a tree in graph theory
ne a cevian of an n-simplex as a ray from each	vertex to a point on the opposite (n-1)-face (facet).
e tree is oriented consistently away from some	vertex forms a subclass of distance-hereditary graphs
A cut	vertex is a vertex the removal of which would disconn
here are two hexagons and one heptagon on each	vertex, forming a pattern similar to a conventional s
semiregular solids can be fully specified by a	vertex configuration, a listing of the faces by numbe
t matching (a matching that covers all but one	vertex in a graph with an odd number of vertices).
In other words, a	vertex with a loop "sees" itself as an adjacent verte
thm that finds a shortest path from an initial	vertex to a goal vertex in a directed graph.
knight chess piece on a chessboard where each	vertex represents a square on a chessboard and each e
c graph in which the nodes reachable from each	vertex form a tree (or equivalently, if G is a direct
notes the number of k-faces in the polytope (a	vertex is a 0-face, an edge is a 1-face, etc.).
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.
directed cubic graph, formed by replacing each	vertex of a hypercube graph by a cycle.
section representation of a graph labels every	vertex with a set so that vertices are adjacent if an
The internal angle at each	vertex of a regular octagon is 135° and the sum of al
ces in a graph is said to be a module if every	vertex in A has the same set of neighbors outside of
Since a	vertex with a loop could never be properly colored, i
beling V2 → Fun(V,V) associating each degree-2	vertex to a linear transformation.
For each	vertex v, add v to a level that is at least one step
No matter which	vertex is added to X to form Y, there will be a Y-fla
The algorithm begins by first examining each	vertex and adding the cheapest edge from that vertex
a simple graph with n vertices in which every	vertex is adjacent to every other.
δ(G) ≥ k - 1, that is, every	vertex is adjacent to at least k - 1 others.
from a subset of its hyperedges have a common	vertex, then all hyperedges of the subset have a comm
Its	vertex figure alternates two regular pentagons and de
ting the r points in each bucket into a single	vertex, yields an r-regular graph or multigraph.
A	vertex of an angle is the point where two rays or lin
he sides of a triangle that come together at a	vertex form an angle.
even component independently, and matching one	vertex of an odd component C to a vertex in U and the
A	vertex or an edge is a critical element of a graph G
Related to the	vertex figure, an edge figure is the vertex figure of
If every	vertex in an n-vertex graph has degree at least n/2 +
cy graph, which is a directed graph where each	vertex is an instruction and there is an edge from I1
round each edge, and 8 dodecahedra around each	vertex in an octahedral arrangement.
dra and tetrahedra can be alternated to form a	vertex, edge, and face-uniform tessellation of space,
ations, vertical projected views of their skew	vertex figures, and partial corresponding uniform hon
determined by removing the ringed nodes of the	vertex figure and ringing the neighboring node.
The problems of finding a	vertex disjoint and edge disjoint cycle covers with m
a	vertex configuration and [n,3] Coxeter group symmetry
uestions of the form "Is there an edge between	vertex u and vertex v?" that have to be answered to d
	Vertex Tower and Residences is 125 meter long up-scal
Given a	vertex v and an edge label i, the rotation map return
ystic fibrosis, currently under development by	Vertex Pharmaceuticals and the Cystic Fibrosis Founda
alues are associated with the poorly connected	vertex 6, and the neighbouring articulation point, ve
rm polyhedrons, where dv is the density of the	vertex figure and df is the density of the face and D
o, Gilson, Corning, VistaLab, Thermo, Jencons,	Vertex, Handypett, and Pricisexx.
It shares the	vertex arrangement and edge arrangement with the cubo
hooses a permutation connecting each hypercube	vertex to another vertex with which it should be conn
ifting again, so the hyperplane intersects the	vertex, gives another rhombic dodecahedral honeycomb
s and directed edges, each edge connecting one	vertex to another, such that there is no way to start
Specifically, a cut	vertex is any vertex that when removed increases the
It has automorphisms that take any	vertex to any other vertex and any edge to any other
e symbols on paths in the DAWG from the source	vertex to any sink vertex (a vertex with no outgoing
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
studied over regular graphs or grids, and the	vertex functions are typically assumed to be identica
	Vertex labels are in black, edge labels in red
Two of them, the	vertex TPCs, are located in the magnetic field of two
omposition of 5 octahemioctahedra, in the same	vertex arrangement as in the compound of 5 cuboctahed
It shares the same	vertex arrangement as the convex regular icosahedron.
It has the same	vertex arrangement as two other simple rhombic tiling
It shares the same	vertex arrangement as the regular convex icosahedron.
It shares the same	vertex arrangement as a nonuniform truncated octahedr
It has the same	vertex arrangement as the pentagonal antiprism.
It shares the same	vertex arrangement as a dodecahedron.
e 10 for having 600 vertices, and has the same	vertex arrangement as the regular convex 120-cell.
ition of 5 small cubicuboctahedra, in the same	vertex arrangement as the compound of 5 small rhombic
x and 2k-1,1 (n-1)-polytope facets, each has a	vertex figure as an (n-1)-demicube, {31,n-2,1}.
They have Wythoff symbol p q r \| and	vertex figures as 2p.2q.2r.
of its vertices with k colours such that each	vertex has at most d neighbours having the same colou
ts in the plane the NNG is a planar graph with	vertex degrees at most 6.
The choice of which	vertex lies at zero is arbitrary with the alternative
The algorithm finds a maximal set of	vertex disjoint augmenting paths of length k.
on scattering has the advantage that the first	vertex can be cleanly described by the well known qua
The internal angle of the spherical digon	vertex can be any angle between 0 and 180 degrees.
d to red ones by any automorphism, but any red	vertex can be mapped on any other red vertex and any
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.
y three vertices, either there exists a unique	vertex that belongs to shortest paths between all thr
ng grey with greenish and reddish reflections,	vertex shining bronze brown, neck tufts shining dark
Head: frons shining ochreous-white;	vertex shining bronze brown with reddish gloss, later
Head: frons shining ochreous-white,	vertex dark brown with reddish gloss, laterally and m
Head: frons shining yellowish white,	vertex light brown, neck tufts brown, medially and la
s-white with greenish and reddish reflections,	vertex bronze brown, neck tufts dark bronze brown wit
oduce the Y-local maps Fi constructed from the	vertex functions by
e thus shown to involve replacing the singular	vertex (node) by either a 3-sphere (by way of deformi
A Swastika (standing on the	vertex) framed by a quadrat.
the triangle; also we are told that C1 covers	vertex 1, C2 covers vertex 2, C3 covers vertex 3, and
borescence is a directed graph in which, for a	vertex u called the root and any other vertex v, ther
The	vertex figure can be seen topologically as a modified
The	vertex types can be directly observed as described in
iplines, a bivariegated graph is a graph whose	vertex set can be partitioned into two equal parts su
blem of finding the size of a minimum feedback	vertex set can be solved in time O(1.7347n),
A graph is said to be k-varigated if its	vertex set can be partitioned into k equal parts such
or of selection is a linear process where only	vertex i-1 can replace vertex i (but not the other wa
ny cell complex C is a flag complex having one	vertex per cell of C. A collection of vertices of the
et to provide links to Holy Cross High and the	Vertex training centre as well as providing future ho
ollapsed into a point, losing one edge and one	vertex, and changing two squares into triangles.
nt and one of the vertices of the polygon; the	vertex is chosen at random in each iteration.
An external	vertex is colored with the field label of its inciden
the three paths between them have exactly one	vertex in common.
Each	vertex v contains the coordinates of the vertex and a
t is, the number of trees for which each graph	vertex (not counting the root) is adjacent to no more
In mathematics, a	vertex cycle cover (commonly called simply cycle cove
ecome 24 tetrahedron cells, and the 96 deleted	vertex voids create 96 new tetrahedron cells.
that D consists of paths and even cycles (each	vertex of D has degree at most two and edges belongin
tallic with greenish and purplish reflections,	vertex shining dark brown with golden gloss, neck tuf
h white with greenish and reddish reflections,	vertex shining dark brown, laterally and medially lin
s-white with greenish and reddish reflections,	vertex shining dark bronze brown with reddish gloss,
ry grey with greenish and reddish reflections,	vertex shining dark brown, neck tufts shining dark br
imensions, made of uniform polytope facets and	vertex figures, defined by all permutations of rings
In the graph theory tree, a leaf node is a	vertex of degree 1 other than the root (except when t
in a Cn equals the number of edges, and every	vertex has degree 2; that is, every vertex has exactl
To contract a loop e at	vertex v, delete e and v but not the other edges inci
red denotes a non-principal	vertex, green denotes an ear and blue denotes a mouth
ach half-edge also has a pointer to its origin	vertex (the destination vertex can be obtained by que
Below is the table of the best known	vertex transitive digraphs (as of October 2008) in th
minus the sum of the outgoing numbers at each	vertex is divisible by four.
ach form; a mirror is active with respect to a	vertex that does not lie on it.
ales of the head are directed forward over the	vertex and down the frons.
It can be obtained by connecting an apex	vertex to each of the degree-three vertices of a rhom
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
uare pyramid is convex and the defects at each	vertex are each positive.
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
entagons), with five pentagons meeting at each	vertex, intersecting each other making a pentagrammic
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
a given planar graph G is a graph which has a	vertex for each plane region of G, and an edge for ea
edge arrangement which means they have similar	vertex and edge arrangements, but may differ in their
Given a CW complex S containing one	vertex, one edge, one face, and generally exactly one
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.
The henagonal henahedron consists of a single	vertex, no edges and a single face (the whole sphere
through the graph must go in or out of the top	vertex (and either one of the lower ones).
Thus the interior angle at each	vertex is either 90° or 270°.
The degree of a	vertex is equal to the number of adjacent vertices.
For an undirected graph, the degree of a	vertex is equal to the number of adjacent vertices.
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.
ph G, one may form a switch graph that has one	vertex for every corresponding pair of vertices in G
a universal graph may be constructed having a	vertex for every possible label.
It is a cubic graph: every	vertex touches exactly three edges.
)-graph is defined to be a graph in which each	vertex has exactly r neighbors, and in which the shor
Each	vertex has exactly m incoming and m outgoing edges.
Corporation, Xanatos demands vast supplies of	Vertex, an expensive crystal worth high monetary valu
case, a DCEL contains a record for each edge,	vertex and face of the subdivision.
The graphs that may be built from a single	vertex by false twin and true twin operations, withou
A	vertex function fi for each vertex i.
The rectified 10-orthoplex is the	vertex figure for the demidekeractic honeycomb.
This polytope is the	vertex figure for a uniform tessellation of 6-dimensi
A	vertex figure for an n-polytope is an (n-1)-polytope.
he theorem states that the size of the minimum	vertex cut for x and y (the minimum number of vertice
rongly, every strongly connected tournament is	vertex pancyclic: for each vertex v, and each k in th
Below is the table of the	vertex numbers for the best-known graphs (as of Octob
This polytope is the	vertex figure for the 162 honeycomb.
The	vertex figure for a regular 4-polytope {p,q,r} is an
For example, a	vertex figure for a polyhedron is a polygon figure, a
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.
Kac, Victor,	Vertex Algebras for Beginners, Second Edition, AMS 19
locally cyclic; that is, the neighbors of each	vertex should form a cycle.
pecial for having all even number of edges per	vertex and form bisecting planes through the polyhedr
theoretic terms, each colour class in a proper	vertex coloring forms an independent set, while each
ation ordering of the graph and that, for each	vertex v, forms a clique for v and its later neighbor
face of the rhombic dodecahedron with a single	vertex and four triangles in a regular fashion one en
The language unifies	vertex and fragment processing in a single instructio
The median bisects the	vertex angle from which it is drawn only in the case
Pop the top	vertex v from S. Perform a depth-first search startin
every	vertex of G is mapped to the spine of B; and
tex graph G as assigning O(logn) bits to every	vertex of G together with an algorithm to determine w
The telescope was designed and constructed by	VERTEX Antennentechnik GmbH (Germany), under contract
The terminology of using colors for	vertex labels goes back to map coloring.
Head: frons and	vertex shining golden bronze, neck tufts shining dark

1 2 3 次へ＞

共起表現

「VERTEX」の共起表現(2語右で並び替え) - Weblio英語共起表現検索

「VERTEX」の共起表現一覧(2語右で並び替え)