subgraph 中文意思是什麼

subgraph 解釋
子圖
  1. We call such a spanning subgraph t an economical spanning subgraph.

    我們稱這樣的生成子圖T為廉價的生成子圖。
  2. The forbidden subgraph problem is a prime example of the rather large family of extremal problems is graph theory.

    禁向子圖問題是圖論中相當大的一類極值問題中的主要例子。
  3. A graph g is called k1, 4 - free graph if g does not contain an induced subgraph that is isomorphic to k1, 4

    所謂凡； 。 free圖是指不含與k ， 。同構的導齣子圖的圖
  4. A well known problem in optimization theory asks for a relatively easy way of finding a spanning subgraph with a special property.

    最優化理論中的一個有名的問題要求：用比較容易的方法來尋求具有某種特殊性質的生成子圖。
  5. A color a e x is legal for an uncolored vertex v e v if by coloring v with a, the subgraph induced by all vertices of color a has maximum degree at most d

    對頂點v是合法的，是指由所有染顏色。的頂點導出的子圖的最大度至多是d ，其中alice和bob每走一步都是用合法顏色染未染色點。
  6. Characteristic graph of dual binary chromatic subgraph of maximal planar graph to be colored with 4 colors

    極大平面圖對偶二色子圖結構特性樹
  7. These questions are special cases of the so called forbidden subgraph problem.

    這些問題都是所謂禁用子圖問題的特殊情形。
  8. But usually it is difficult to work out the hamilton problem of any graph, then we turn to explore the graphs containing forbidden subgraph, for example, claw - free graph, almost claw - free graph, quasi claw - free graph

    由於直接研究任一圖類的hamilton問題往往比較困難，於是人們轉而研究含有某些禁用子圖的圖類，如：無爪圖，幾乎無爪圖，擬無爪圖等
  9. We define the weighted degree of v by the weight of a subgraph h of g is defined by the one with maximum weight among a certain kind of subgraphs is also called heaviest. so a heaviest cycle is a cycle with maximum sum of all edge ' s weights among all cycles of a graph

    頂點v的賦權度定義為圖g的子圖h的權定義為某類子圖中權最大的又叫最重的，所以最重回也就賦權用的所有回中權之和最大的回
  10. Tow maximal planar graphs with path bichromatic subgraph only

    兩個只有路型二色子圖的極大平面圖
  11. The molecular structure of alkanes is described by anovel molecular subgraph coding method, recently developed in this laboratory. it has been shown that there exist very good quantitative structure property / function relationships ( qspr / qsfr ) between the coding and 7 thermodynamical functions and 8 physical properties of alkanes

    在拓撲不變量的基礎上直接將子圖分類、計數、編碼，提出了一種新分子拓撲子圖指數，已數字化的子圖編碼部分保持具體分子結構的直觀信息。
  12. A sufficient condition to decide a simple graph with a complete subgraph

    簡單圖含有完全子圖的一個充分條件
  13. A note on maximum number of edges in a spanning eulerian subgraph

    生成子圖極大邊數的一個注記
  14. A method to probe into the number of edges of spanning eulerian subgraph

    生成子圖邊數的一種方法
  15. We call such a spanning subgraph t an economical spanning subgraph

    我們稱這樣的生成子圖t為廉價的生成子圖。
  16. The lattice implication algebra is a theoretical basis for the theory of lattice valued logic and approximate reasoning. in 1987, alavi and others conjectured that every graph with positive size has an ascending subgraph decomposition. this conjecture is an unsolved problem in graph theory

    與圖論中的其它問題一樣，對圖的升分解問題的構造式證明本質上是尋找一種解決可以抽象為圖的升分解問題的一類實際應用問題的演算法，因此，關于圖的升分解問題的研究工作對利用計算機解決這類實際問題具有現實意義。
  17. In chapter 3, orthogonal factorizations of graphs, including [ 0, k1 ] m - factorizations orthogonal to a subgraph and orthogonal factorizations of bipartite graphs, is mainly studied

    第三章研究了圖的正交因子分解問題，主要包括與任意圖正交的[ 0 ， k _ i ] _ l ~ m -因子分解和二分圖的正交因子分解
  18. In order to handle the subgraph isomorphism problem, the concept of individuals with state backtracking was proposed, where the state information of some potential individuals produced during the evolution were preserved, which contributed to the design of genetic operators

    針對圖數據挖掘中經常遇到的子圖同構問題，提出了帶狀態回溯個體的概念，從而使遺傳運算元的設計更為合理。
  19. 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 }發生，我們就說滲流發生。
  20. If t is a subgraph of a graph g, then the edges of g not included in t are called links or chords.

    如果T是圖G的一個子圖，則G中不包含在T中的邊稱為鏈支或弦。
分享友人
分享到 Line

分享到臉書