「vertex」の共起表現一覧(2語右で並び替え)2ページ目
該当件数 : 566件
| depth first search whenever the loop reaches a | vertex that has not already been included in a previo |
| e, X consists of the two neighbors of a corner | vertex and has two X-flaps: one consisting of that co |
| The | vertex figure has 8 vertices and 12 5-cells. |
| Joining by an edge every | vertex labeled i to every vertex labeled j (denoted n |
| graph theory, an exact coloring is a (proper) | vertex coloring in which every pair of colors appears |
| hich also has 3 triangles and two squares on a | vertex, but in a different order. |
| ertices in S is connected by an edge and every | vertex not in S is missing an edge to at least one ve |
| Take U as the | vertex set in the hypergraph, and V as set of edges. |
| harmonious coloring in the sense that it is a | vertex coloring in which every pair of colors appears |
| cs, a star coloring of a graph G is a (proper) | vertex coloring in which every path on four vertices |
| S is a | vertex separator in G. |
| raph theory, an acyclic coloring is a (proper) | vertex coloring in which every 2-chromatic subgraph i |
| e the multigraph formed by adding a single new | vertex v in the unbounded face of G, and connecting v |
| simultaneously computes the distances to each | vertex t in the graphs Gt, it is also possible to fin |
| If the two removed edges meet at a | vertex, as in Figure B, the remaining graph contains |
| are trees directed towards the root at a fixed | vertex w in G. |
| . Razgon : Computing Minimum Directed Feedback | Vertex Set in O*(1.9977n). |
| That is, every | vertex lies in the tree, but no cycles (or loops) are |
| First, a distance sequence from a | vertex v in a graph is the sequence n1, n2, n3, ..., |
| re exactly the block graphs in which every cut | vertex is incident to at most two blocks, or equivale |
| aph (that is, a polyhedral graph in which each | vertex is incident to exactly three edges) has a Hami |
| perpendicular onto this side from the opposite | vertex falls inside this segment. |
| ith 4 equilateral but nonplanar hexagons, each | vertex with internal angles alternating between 108 a |
| nguage that controlled the GPU pipeline for 3D | vertex and interpolated pixel properties, respectivel |
| two vertices embedded to the same point and no | vertex embedded into a point within an edge. |
| e graph, with the reachability ordering on the | vertex set) into layers (sets of vertices with the sa |
| ant is "large" if any possible division of the | vertex set into two subsets has "many" links between |
| The | vertex figure is determined by removing the ringed no |
| In geometry, an apex is the | vertex which is in some sense the highest of the figu |
| The cut surface or | vertex figure is thus a spherical polygon marked on t |
| 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 |
| This | vertex arrangement is called the A5 lattice or 5-simp |
| 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 |
| 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}. |
| logue of the) unit interval is the graph whose | vertex set is {0,1} and which contains a single edge |
| 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 |
| 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 |
| Formally, given a graph G, a | vertex labeling is a function mapping vertices of G t |
| 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. |
| For example a square | vertex arrangement is understood to mean four points |
| A | vertex w is said to be adjacent to another vertex v i |
| Its | vertex figure is a triangular prism, with 3 icosidode |
| 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. |
| The | vertex figure is determined by removing the ringed no |
| The | vertex arrangement is also shared with the compounds |
| 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 |
| The | vertex figure is a triangular prism, containing two c |
| e, starting with a tree consisting of a single | vertex, until it spans all vertices. |
| s an undirected edge-labeled graph, where each | vertex enumerates its outgoing neighbors. |
| While the adjacency matrix depends on the | vertex labeling, its spectrum is a graph invariant. |
| s, while the word loop is an edge connecting a | vertex with itself) correspond to the quantum correct |
| same two distinct vertices, no edge connects a | vertex to itself, and the graph is connected. |
| loop or a "buckle") is an edge that connects a | vertex to itself. |
| here is a trivial path of length zero from any | vertex to itself. |
| A special case is a loop that connects a | vertex to itself; if such an edge exists, the vertex |
| r the treatment of hepatitis C co-developed by | Vertex and Johnson & Johnson. |
| This new | vertex is joined to every element in the original sim |
| from L one of the leaves associated with each | vertex in K. |
| p F: Kn → Kn is the finite directed graph with | vertex set Kn and directed edges (x, F(x)). |
| This essentially means that for each unmatched | vertex in L, we add into T all vertices that occur in |
| ently labeled if all of the edges leaving each | vertex are labeled in such a way that at each vertex, |
| alled an incidence list, which stores for each | vertex a list of objects representing the edges incid |
| 2-dimensional tilings, they can be given by a | vertex configuration listing the sequence of faces ar |
| For polytopes, a | vertex may map to zero, as depicted below. |
| oms business, Your Communications in 2006, and | Vertex in March 2007. |
| The | vertex of maximum degree in T' is the least among all |
| m, points are not ordered and so more than two | vertex points may be allowed. |
| he cevians through the point from each polygon | vertex which meet the opposite sides. |
| The | vertex addition method began with an inefficient O(n2 |
| use if a particular path from the root to some | vertex is minimal, then any part of that path (from n |
| t cycles, then every shortest path visits each | vertex at most once, so at step 3 no further improvem |
| re must contain equal numbers of both types of | vertex and must have an even length. |
| coloring of a graph is almost always a proper | vertex coloring, namely a labelling of the graph's ve |
| Head: frons shining greyish white, | vertex and neck tufts shining dark bronze brown with |
| chreous with greenish and reddish reflections, | vertex and neck tufts shining golden brown, medially |
| bronze with greenish and reddish reflections, | vertex and neck tufts shining dark brown with reddish |
| chreous with greenish and reddish reflections, | vertex and neck tufts brown with reddish gloss, later |
| Head: frons shining pale ochreous, | vertex and neck tufts shining greyish brown, laterall |
| frons shining white with greenish reflection, | vertex and neck tufts shining greyish brown with redd |
| us-grey with greenish and reddish reflections, | vertex and neck tufts shining bronze brown with reddi |
| own with greenish and reddish and reflections, | vertex and neck tufts brown with reddish gloss, media |
| s-white with greenish and reddish reflections, | vertex and neck tufts shining greyish brown with redd |
| Head: frons shining pale ochreous, | vertex and neck tufts shining ochreous-brown, mediall |
| rey with greenish and reddish and reflections, | vertex and neck tufts dark bronze brown with reddish |
| ns shining pale grey with greenish reflection, | vertex and neck tufts bronze brown, posteriorly olive |
| Head: frons shining greyish white, | vertex and neck tufts shining dark bronze brown, late |
| ining ochreous-white with greenish reflection, | vertex and neck tufts brown, narrowly lined white lat |
| y pale greyish brown with reddish reflections, | vertex and neck tufts dark greyish brown with greenis |
| shining greyish white with reddish reflection, | vertex and neck tufts shining bronze brown with reddi |
| h white with greenish and reddish reflections, | vertex and neck tufts dark brown with reddish gloss, |
| h white with greenish and reddish reflections, | vertex and neck tufts shining greyish brown with redd |
| Head: frons shining ochreous-grey, | vertex and neck tufts shining dark brown with a media |
| s-white with greenish and reddish reflections, | vertex and neck tufts dark brown with reddish gloss, |
| us-grey with greenish and reddish reflections, | vertex and neck tufts dark bronze brown, laterally an |
| s-white with greenish and reddish reflections, | vertex and neck tufts dark bronze brown with reddish |
| g white with greenish and reddish reflections, | vertex and neck tufts shining dark brown with reddish |
| chreous with greenish and reddish reflections, | vertex and neck tufts shining dark bronze brown with |
| rey with greenish and reddish and reflections, | vertex and neck tufts shining dark bronze brown with |
| Head: frons shining greyish white, | vertex and neck tufts shining dark bronze brown with |
| g pale ochreous-grey with greenish reflection, | vertex and neck tufts shining brown with reddish glos |
| Head: frons shining ochreous-white, | vertex and neck tufts shining greyish brown with some |
| s-white with greenish and reddish reflections, | vertex and neck tufts shining ochreous-brown with red |
| us-grey with greenish and reddish reflections, | vertex and neck tufts shining bronze brown with reddi |
| hining greyish white with greenish reflection, | vertex and neck tufts shining dark olive brown, later |
| Head: frons shining pale golden metallic, | vertex and neck tufts shining dark bronze brown with |
| s-white with greenish and reddish reflections, | vertex and neck tufts shining bronze brown with reddi |
| hining ochreous-white with reddish reflection, | vertex and neck tufts shining greyish brown with redd |
| chreous with greenish and reddish reflections, | vertex and neck tufts shining dark brown with greenis |
| h white with greenish and reddish reflections, | vertex and neck tufts shining bronze brown with green |
| g pale ochreous-grey with greenish reflection, | vertex and neck tufts shining bronze brown with reddi |
| shining greyish white with golden reflection, | vertex and neck tufts shining dark bronze brown with |
| Note that only one additional | vertex is needed to draw the second triangle. |
| aph in terms of the minimum number of distinct | vertex labels needed to build up the graph from disjo |
| An isolated | vertex has no adjacent vertices. |
| Choose an arbitrary | vertex v not in S. Perform a depth-first search start |
| pe formed by joining two triangles at just one | vertex is not a proper polyabolo. |
| on is thus uniform) it can be represented by a | vertex configuration notation sequencing the faces ar |
| A complete bipartite graph Km,n has a | vertex covering number of min{m,n} and an edge coveri |
| vertex covering number - the minimal number of vertic | |
| chreous with greenish and reddish reflections, | vertex pale ochreous-yellow, neck tufts shining bronz |
| All the solid angles and | vertex figures of a disphenoid are the same. |
| ey are called star polygons and share the same | vertex arrangements of the convex regular polygons. |
| In mathematics, the polar sine of a | vertex angle of a polytope is defined as follows. |
| Choose an arbitrary | vertex r of G as a starting point. |
| 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 |
| discipline of graph theory, the edge space and | vertex space of an undirected graph are vector spaces |
| of the Stella octangula (which share the same | vertex arrangement of a cube). |
| S are subsets of G such that , where V is the | vertex set of G. |
| The | vertex figure of the grand antiprism is a dissected r |
| The edge figure is the | vertex figure of the vertex figure. |
| For example, a | vertex configuration of (4,6,8) means that a square, |
| (The actual | vertex figure of the THHH is 3.4.3/2.4, |
| Let A, B, C denote the | vertex angles of the reference triangle, and let x : |
| This polytope is the | vertex figure of the 9-demicube, and the edge figure |
| The | vertex space of a graph is a vector space having a se |
| The edge figure is the | vertex figure of the vertex figure, here being a bire |
| ism group acts transitively on each of the two | vertex sets of the bipartition. |
| Since the | vertex sets of (finite) graphs are commonly identifie |
| group must act transitively on each of the two | vertex sets of the bipartition. |
| Given a multigraph M, take U as the | vertex set of M and take V as the edge set of M. Then |
| cover of G has two vertices ui and wi for each | vertex vi of G. Two vertices ui and wj are connected |
| The | vertex figure of the uniform polyhedron, great dirhom |
| The 12 vertices of the convex hull matches the | vertex arrangement of an icosahedron. |
| The | vertex arrangement of this compound is shared by a co |
| Each has a | vertex figure of a {31,n-2,2} polytope is a birectifi |
| opagator that connects back to its originating | vertex are often also referred as tadpoles. |
| The apex of urinary bladder ( | vertex in older texts) is directed forward toward the |
| s-white with greenish and reddish reflections, | vertex shining olive brown with greenish and reddish |
| In the plane, each | vertex has on average six surrounding triangles. |
| be the equilateral triangle having base BC and | vertex A' on the negative side of BC and let AB'C and |
| inite henagon can be drawn by placing a single | vertex anywhere on a great circle. |
| cle (a cycle of edges that passes through each | vertex exactly once). |
| cle, a henagon is a tessellation with a single | vertex, and one 360 degree arc. |
| As a graph with one outgoing edge per | vertex and one root reachable by all other vertices, |
| er pentagon and an inner five-point star, each | vertex on one side of the partition has exactly one n |
| side located on one the faces containing that | vertex and opposite to it, are in the ratio √2:√3:√5. |
| ontain either star polygon faces, star polygon | vertex figures or both. |
| This | vertex arrangement or lattice is called the B4, D4, o |
| egular uniform polyhedra are listed with their | vertex configuration or their Uniform polyhedron inde |
| ongoing concerning spanners with either small | vertex degree or a small number of edges. |
| quiring no arbitrary choice of side as base or | vertex as origin. |
| It cannot go in one lower | vertex and out the other. |
| Exactly one | vertex of out-degree 0 (no outgoing arcs), called the |
| 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. |
| In modern terms, the defect at a | vertex or over a triangle (with a minus) is precisely |
| lity graph of a poset (P, ≤) is the graph with | vertex set P in which the edges are those pairs of di |
| Head: frons shining silvery white, | vertex shining pale brown, neck tufts dark brown, lat |
| 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. |
| G as a switch graph in which the edges at each | vertex are partitioned into matched and unmatched edg |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
