vertex in a graph 中文意思是什麼

vertex in a graph 解釋
一圖形中的頂點
  • vertex : n. （pl. vertexs, -tices ）1. 頂（點），絕頂。2. 【解剖學】顱頂，頭頂；【天文學】天頂；【幾】頂（點）。
  • in : adv 1 朝里，向內，在內。 A coat with a furry side in有皮裡子的外衣。 Come in please 請進來。 The ...
  • a : an 用在以母音音素開始的詞前〉 indefinite art 1 〈普通可數名詞第一次提到時，冠以不定冠詞主要表示類...
  • graph : n. 1. 【數學】曲線圖；坐標圖，圖表。2. 統計曲線。vt. 用圖表表示，把…繪入圖表。n. 膠版。vt. 用膠版印刷。n. 【語言學】1. 詞的拼法。2. 表示音素的最小字母單位。
  1. In this paper, we disscuss the problem on cyclic structure of graphs. we provide three sufficient conditions on the existence of long cycles passing through a specified vertex, a specified edge in unweighted graphs, and three sufficient conditions on the existence of heavy cycles in weighted graph

    本文主要研究了非賦權圖及賦權圖的圈性結構問題，給出了非賦權圖過指定點、指定邊長圈存在的三個充分條件，並且還給出了賦權圖重圈存在的三個充分條件
  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. In the first chapter, the background and some basic results are introduced. in the second chapter, we study higher order edge connectivity, and obtained ( a ) except for three graphs, all infinite circulants with finite jump sequence are super - ; ( b ) except for three classes of graphs, all edge transitive graphs are optimally - ( 3 ) ; ( c ) the optimally - ( 3 ) property is characterized for vertex transitive graphs, in particular, necessary and sufficient conditions are give for cayley graphs to be optimally - ( 3 ) ( d ) a sufficient condition for a graph to be optimally - ( 3 ) is given

    第二章中，我們研究高階邊連通度，得到了如下結果： （ a ）除了三個特殊圖外，所有具有有限躍階的無限循環圖都是超邊連通的； （ b ）除了三種特殊圖類外，所有邊傳遞圖都是最優- ~ （ 3 ）圖； （ c ）刻劃了點傳遞圖的最優- ~ （ 3 ）性，特別是給出了cayley圖和極小cayley圖為最優- ~ （ 3 ）圖的充分必要條件； （ d ）給出了一個圖（不一定是對稱圖）是最優- ~ （ 3 ）圖的一種充分條件。
  4. 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個公共元。
  5. 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下的運算
  6. A distributed algorithm for finding the weak vertex cover of a graph is presented in this paper, which can be used for monitor - nodes selection in net traffic measurement

    摘要提出了一種分散式求解弱頂點覆蓋集的近似演算法，用於網路流量有效測量點的選擇。
  7. A closed path in a graph that does not pass through any vertex more than once and passes through at least three vertices

    圖中經過三個以上頂點且經過每個頂點僅一次的一條封閉路徑。
分享友人
分享到 Line

分享到臉書