vertex set 中文意思是什麼

vertex set 解釋
頂點集
  • vertex : n. （pl. vertexs, -tices ）1. 頂（點），絕頂。2. 【解剖學】顱頂，頭頂；【天文學】天頂；【幾】頂（點）。
  • set : SET ＝safe electronic transaction 安全電子交易〈指用信用卡通過因特網支付款項的商業交易〉。n 【埃...
  1. A star is defined as the set of edges incident to a vertex.

    一個星形定義為關聯于某個頂點的邊的集合。
  2. Seven years later more than 1000 research papers had been published on dominating sets and related sets in graphs, and the field is steadily growing. in this paper, we discuss the relationship between the total domination number and the least domination number. the total domination number of a graph g is the minimum cardinality of a dominating set of gsuch that every vertex in v has at least one neighbor in d. the least domination number of g is the minimum cardinality of a dominating set of g whose domination number is the minimum

    圖g的全控制集是滿足v中每個點都至少有一個鄰點在其中的控制集，而g的全控制數_ t （ g ） = nin { / d / | d是g的全控制集} ；圖g的小控制集是滿足其控制數在所有g的控制集中達最小的控制集，而g的小控制數_ l （ g ） = min { | x | | x是g的小控制集} 。
  3. A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removing the vertex subset from the graph

    摘要若從一個圖中去掉某些頂點后得到的導齣子圖是無圈圖，則所去的那些頂點組成的集合就是原圖的反饋點集。
  4. And concerning boundary conditions along piping system are properly set. futhermore, vertex sound is discussed in this paper. effect of the noise reduction about the mufflers is analysed, and a lot of trials is used to testify exist of valve noise and influence to pipe system. there kinds of mufflers are proved that they can reduce the fluid niose of pipe system by a large number of experimentation

    對噪聲的抑制裝置? ?消聲器的降噪效果進行了分析，並結合實際工作建立了模擬海水管路試驗臺架，通過一系列試驗，說明閥門噪聲的存在，及其對管路流噪聲的影響，證明設計的三種結構消聲器對管路流噪聲的良好消減效果。
  5. This paper studies the band percolation of the models of the triangle lattice and the hexagonal lattice. before we study the models of the triangle lattice and the hexagonal lattice, we will introduce period. let g = ( vc, ec ) be a connected graph, we write vg for the set of vertices of g and egfor the set of its edges, u e vc is a vertex, and v is the coordinate vector

    在介紹平面正三角形和正六邊形點格的邊滲流模型之前我們先引入周期的概念：設g = （ v _ g ， e _ g ）為連通圖其中v _ g ， e _ g分別為圖g的頂點集和邊集， u v _ g為的頂點， v為平面的坐標向量。
  6. Its vertices are located at all points of the form ( i1, i2 ) or each vertex has six neighbors. the six neighbors of the vertex v are the set of vertices the set of edges e the model of the hexagonal lattice the usual way to imbed the hexagonal lattice is such that its face are regular hexagons. the vertices are the points. the origin is in the center of one of the hexagons and the periods are (, 0 ) and ( 0, 3 )

    頂點集合為為整數邊的集合為相鄰}正六邊形點格模型為：平面是由正六邊形點格組成，它的頂點坐標為其中，原點在一個正六邊形的中心，周期為（ 3 ~ （ 1 / 2 ） ， 0 ）和（ 0 ， 3 ）我們可以把它在豎直方向壓縮1 3 ~ （ 1 / 2 ）倍使它成為周期圖。
  7. Basic graph is a graph for which basis set of matroid is consisting of vertex set. two vertexs are adjoining if and only if there are exactly p ( m ) - l commonality elements in their bases. thus it plays an important role in the further studying

    基圖是一個以擬陣的基集為頂點集的圖，使圖中的兩個頂點是鄰接的當且僅當這兩個頂點對應的基恰好有p （ m ） - 1個公共元。
  8. Petersen graph is well known in graph theory, a generalized petersen graph, denoted by f ( m, a ), is defined as follows : its vertex set is u u w, where u - { < / 0. ?, ? ? ? um - i ], w ? [ w0, wi, ? ? ? wm - i }, its edges are given by ( u ;, wi ), ( ui

    Petersen圖是圖論中我們熟知的圖，廣義petersen圖，記為p （ m ， a ） ，是有2m個頂點的圖，其頂點集為，邊有點對和給出，這里下標的運算都是在模m下的運算
  9. Software vertex processing provides a guaranteed set of vertex processing capabilities, including an unbounded number of lights and full support for programmable vertex shaders

    軟體頂點處理提供可保證的頂點處理能力集，包括無限制的光源數量和對可編程的頂點著色器的完全支持。
  10. But this algorithm do not guarantee the minimization of the set of vertex cover, which mean while do not guarantee it can be fixed that all of fault chips which should be fixed

    但該演算法的缺點在於不能保證求出頂點覆蓋的最優解。也就是說，當一片晶元在事實上是可修復時卻有可能在近似演算法中得到不可修復的結論。
  11. Since 1988 vince proposed the conception of star - chromatic number, a large amount of study about star - chromatic number, circular chromatic number and the way to do study have been achieved. then graph g were produced. lt has vertex set { 0, 1, 2, . .,

    1988年， vince提出星色數的概念之後，得到了大量的關于星色數、圈色數的研究。引出了一類特殊的圖： g _ d ~ k圖，它有點集{ 0 ， 1 ， 2 ，
  12. Applies the vertex processing defined by the vertex shader to the set of input data streams, generating a single stream of interleaved vertex data to the destination vertex buffer

    將頂點著色器定義的頂點處理過程應用到輸入數據流組，從而生成從插入的頂點數據到目標頂點緩沖區的單個流。
  13. Set up the vertices and vertex shader

    設置頂點和頂點著色器。
  14. Represents a custom vertex format structure that contains transformed vertices and one set of texture coordinates

    表示自定義頂點格式結構，該結構包含轉換的頂點顏色和一組紋理坐標。
  15. A series of recent papers has aimed at giving good bounds of feedback vertex set for families of graphs broadly known as : butterflies, hypercubes, meshes, star graphs, and so on

    摘要最近諸多文章旨在討論關于反饋結點集的上下界問題，比如：蝴蝶網、超立方體、網格、星圖等等。
  16. Compare to existing results for general graph, new lower bound on the size of the minimum feedback vertex set of ( n, k ) - star graph is given based on its special structure

    本文主要討論了關于組合星圖反饋結點集的下界問題，在基於組合星圖的性質和已有相關結果的基礎上，給出了組合星圖反饋結點集的新的下界。
  17. A polynomial algorithm for minimum - cardinality feedback vertex set problem in outerplanar graphs

    一個求外平面圖最小反饋點集的多項式時間演算法
  18. Consider the random subgraph of t containing the vertex set z and the open edges only. the connected components of this graph are called open cluter. usually, we write it in the short term c. some people say that " percolation occurs ' when there exists an infinite open cluster

    在樹t中，用開路互相連通的點形成一個開串（ cluster ） ，我們記| c |為包含原點o的開串c中的點的個數，若事件{ | c | = o }發生，我們就說滲流發生。
  19. Based on the hoppe ' s progressive mesh generation algorithm, restrict the simplified mesh model ’ s vertices to the initial mesh model ' s vertex set, when refinement sequence is generated. this can reduce the information included in the refinement sequence

    在hoppe漸進網格生成演算法的基礎上，在生成細化序列時，將簡化網格模型的頂點局限於初始網格模型的頂點集合中，減少了細化序列所包含的信息。
  20. It is a time - dependent model. it was introduced by hammersley and welsh in 1965. it mainly studies the property of vertex set to which from one certain point during some given time, under conditions that the network of the path has been given. but the travel time of the path is random

    它主要研究當路的網路已經給定，但路的通過時間為隨機的情況下，從某一固定點出發，在給定的時間內能夠到達的點的集合的性質。
分享友人
分享到 Line

分享到臉書