the theory of graphs 中文意思是什麼

the theory of graphs 解釋
圖論
  • the : 〈代表用法〉…那樣的東西，…那種東西。1 〈用單數普通名詞代表它的一類時（所謂代表的單數）〉 （a） 〈...
  • theory : n. 1. 理論，學理，原理。2. 學說，論說 （opp. hypothesis）。3. 推測，揣度。4. 〈口語〉見解，意見。
  • of : OF ＝Old French 古法語。
  • graphs : 統計圖形
  1. The completion problems of partial inverse m - matrix for 3 - chordal graph are discussed by using graph theory and the completion theorems for 3 - chordal graphs are presented in this paper

    摘要利用圖論的相關知識，在1 -弦圖、 2 -弦圖完備的基礎上探討了3 -弦圖的完備問題，給出3 -弦圖的完備定理。
  2. Analyse the tooth geometry of klingelnberg cyclo - palloid spiral bevel gear., according to the relative position and kinematic relation of the cutter heads, virtual crown gear and the processed wheel blank, established the system of coordinates of the gear cutting, dedcuced the tooth face equation of the virtual crown gear, according to relations of the gear cutting and space theory of engagement, deduced the tooth face equation of klingelnberg cyclo - palloid spiral bevel gear, and drawing the three - dimensional graphs of the virutal crown gear and klingelnberg cyclo - palloid spiral bevel gear according to the design and setting parameters

    對克林貝格擺線齒錐齒輪進行齒面幾何分析。根據銑齒加工中刀盤、搖臺和輪坯的相對位置和相對運動關系建立了切齒嚙合坐標系，由矢量的旋轉推導了產形輪齒面方程;根據空間嚙合原理和切齒嚙合關系推導了被加工齒輪的齒面方程;由設計參數和銑齒調整參數計算得到齒面離散數據，繪制了產形輪和擺線齒錐齒輪的三維齒形。
  3. Claw - free graphs have been a subject of interest of many authors in the recent years. the first motivation for studying properties of claw - free graphs apparently appeared from the beineke ' s characterization of line graphs in [ 4 ], [ 5 ]. however, the main impulse that turned the attention of the graph theory community to the class of claw - free graphs was given in late 70s and early 80s. during the period some first results on hamiltonian properties were proved in [ 6 ], [ 7 ], [ 8 ], [ 9 ]. prom then on, more and more authors began to study the problem of hamilton. they studied mainly in the following two aspects : cycle aspect and path aspect. we may obtain some results about cycle in [ 3 ] and [ 10 - 30 ]

    研究該圖類的最初動機來源於deineke [ 4 ] ， [ 5 ]線圖的特性，然而引起人們尤其注意是在70年代末80年代初，整個這個時期在[ 6 ] ， [ 7 ] ， [ 8 ] ， [ 9 ]中關于哈密頓性質的一些初步結果被證明從此用無爪圖來研究哈密頓問題日益活躍，人們主要從以下兩個方面來研究：圈方面和路方面其中關于圈方面的部分結果可參見文獻[ 3 ]及[ 10 - 30 ]等
  4. The keys to the families, genera and species of hepaticae and anthocerotae in hebei are worked out, and the dissected graphs are pictured. moreover, the chinese name, science name, major reference literatures, collect locations, collector and number of specimen, as well as geographical elements and distribution of every species are narrated explicitly. in the hepaticae - flora of hebei, grimaldiaceae, porellaceae and frullaniuccae arc regarded as dominant, showing obvious temperate - zone character and distinct torrid - zone nature, raising the tropic origion theory of china botany - flora which brought forward by professor z. y. wu

    同時，根據標本和資料編制了河北省苔類植物科、屬、種檢索表，詳細記述了每種的中文名、學名、主要參考文獻考證、標本採集地、採集人和標本號，在河北省和中國各省區及世界范圍的地理分佈等，描述了每一種與其相近似種的主要區別點和識別特徵，並根據標本和文獻對其中54種做了顯微繪圖。
  5. The supereulerian graph problem is an important study in the circle of graph theory, which mainly includes two aspects : one is the determination of supereulerian graphs and the other is the edge - problem

    超歐拉圖問題是圖論研究中非常重要的一個問題，這一問題主要有兩方面：一判定問題，二邊數問題。
  6. The theory of rectilinear embeddings of graphs has been used in the design of vlsi

    摘要縱橫嵌入的理論已被用在超大規模集成電路的設計中。
  7. In the molecular orbital theory, the molecule of the conjugated hydrocarbons considered generally can be represented in carbon - atom skeleton graph, the character of this kind of graphs is that all vertices have degree no greater than three and have a perfect matching

    在分子軌道理論中，所考慮的共軛碳氫化合物的分子常用碳原子骨架圖來表示，此類圖的特徵是所有頂點的度不超過3 ，並且具有完美匹配。
  8. The algorithm for certificates path construction that it is suitable for pki with bridge certification authority and cross authentication is proposed based on the theory of breadth first search algorithms for graphs

    基幹圖的寬度優先搜索理論，提出了適用於具有橋接ca和交叉認證的pki系統中的證書路徑構造演算法。
  9. In fact, it is helpful to the development of graph theory to discover special kinds of integral directed graphs

    事實上，對于有向圖的整性的研究，對圖論的發展和豐富有著重大意義。
  10. With the theory and the graphs, the initial sizes of bpf were obtained, and then the final sizes were obtained by the software simulation

    結合濾波器理論設計的耦合值與所創建的圖表，確定濾波器的初始尺寸，通過軟體對濾波器參數的微調，最終得到濾波器的精確模型。
  11. By means of the precise integration method with lagrangian interpolation the trajectory of the shaft center, the poincare mapping and the bifurcation graphs are numerically given. the results predicted by the floquet theory are checked and the long - term dynamic behavior of the system is predicted. it is shown that the system has rich nonlinear behaviors at some m combination of the four parameters, for examples, multi - frequency subharmonic resonance, as well as chaos phenomenon from doubling bifurcation and twice hopf bifurcation

    通過lagrange插值精細積分法數值給出系統的軸心軌跡圖、 poincar映射圖、分叉圖，檢驗floquet理論預測結果並預測系統的長期性態，顯示系統在四個參數組合的某些范圍內具有豐富的非線性特性，還存在多形式次諧波解，以及由倍周期分叉、二次hopf分叉通往混沌的現象。
  12. The data structures are reminiscent of graphs, and the mathematical basis lies in graph theory

    數據結構與圖形關聯，並以圖形理論做為其數學基礎。
  13. The theory of graphs can be roughly partitioned into two branches : the areas of undirected graphs and directed graphs ( digraphs )

    圖論大致可分為兩個方向：無向圖與有向圖。
  14. Input pulse signal can be directly transformed into micro - step linear motion by use of linear pulse motor, which have found wide applications in the digital linear servo systems with high positional accuracy and high reliability. taking slpmu - 025a, a two - phase hybrid lpm manufacturing by shinko motor company ltd, as an specimen, the study on the drive control system is carried out in this thesis, which contains : ( l ) three kinds of drive circuits are designed and comparison analysis in theory is done ; ( 2 ) introduction to at89c51 microchip as controller and special micro - step constant current driver, a great variety of running modes driver control are developed ; ( 3 ) experimental testing and theoretical analysis of current waveforms and displacement graphs and velocity graphs are carried out in case of different micro - step constant current driver

    本文以日本神鋼電機株式會社生產的兩相混合式直線脈沖電機slpmu - 025a為樣機，對直線脈沖電機的驅動控制系統進行了研究，內容包括： （ 1 ）設計了幾種直線脈沖電機驅動器電路，從理論上進行了對比分析研究； （ 2 ）用at89c51單片機作為控制器，採用專用的恆流細分驅動器sh ? 2h057m ，實現了開環控制方式下對slpmu ? 025a樣機各種運行方式的驅動控制； （ 3 ）對不同細分數下恆流驅動的電流波形以及各種運行方式下的位移圖、速度圖進行了實驗測試和理論分析研究。
  15. T - colorings of graphs arose from the frequency assignment problem. hale [ 8 ] formulated it in graph theory language

    圖的t -染色的概念起源於通信領域中的頻率分配問題。
  16. So this article put forward a theory that the optimal problems can be summed up to the mathematic and computing models of state space search of optimal problems. this conclusion unifies the dijstra algorithm used in finding shortest path of traditional explicit graphs and the optimal search of implicit graphs, the search of graph and the search of graphs " tree into a common model and algorithm

    本文提出了將優化問題歸結為狀態空間最優化搜索問題的數學模型和通用演算法，將傳統的在顯式圖中求最短路的dijstra演算法與隱式圖的優化搜索，隱式圖搜索與隱式樹搜索全部統一到同一個模型和演算法中去。
  17. Deferred global view maintenance can speed up the update transactions by shifting maintenance into a deferred transaction, but even strict two phase locking ( 2pl ) can not guarantee the serializable execution of transactions in this case. this paper develops a serializabitity theory base upon conflicts and serialization graphs in presence of deferred global view maintenance

    由於延遲視圖維護機制允許修改事務在全局視圖沒有進行相應的改動之前提交，有暫時的數據不一致情況出現，在這種情況下，即使嚴格的zpl協議也不能保證全局事務的可串列化執行。
  18. Based on this theory, we discuss rectilinear extensions of two particular kinds of 4 - regular graphs with the minimum total number of bends in this article, and obtain a simple algorithm as well as the minimum total number of bends

    本文作者在這一理論的基礎上，進一步研究了兩個特殊的4 -正則圖類，得到了確定這兩類圖的最小折數縱橫擴張的簡便演算法，並給出了這兩類圖的縱橫擴張的最小折數。
  19. Therefore the research of connectivity and stability of graphs has been a hot point in graph theory for long time. centering on this topic, except connectivity and edge - connectivity in early period, some new connected parameters of graph were introduced in succession

    圍繞這個問題，除了早期的點（邊）連通度外，人們后來又相繼引入了一些新的連通性參數，主要有聯結數，離散數，完整度和邊完整度，粘連度和邊粘連度，堅韌度等。
  20. Apparently, that g is fully cycle extendable which implied hamiltonicity is a stronger result than g is hamiltonian, so that we study the problem of fully cycle extendable is equate to study the hamiltonian problem which is one of the four difficult problems in graph theory. later on, many authors oberserved many other special classes of graphs by improved claw - free graphs because they are not satisfied with the study of claw - free graphs

    顯然圖g是完全圈可擴的是比圖g是哈密頓圖更強的結果，所以研究完全圈可擴問題就研究了圖論的難題之一哈密頓問題后來人們不滿足於無爪圖的研究，把無爪圖進行改進得到了一系列的特殊圖類
分享友人
分享到 Line

分享到臉書