star graph 中文意思是什麼
star graph
解釋
星形圖-
The dynamic control diagram of pump well is a way to describe relations between liquid supporting and liquor drainage of a well or an area when oil extracting, it underwent eye measurement, star graph and pump state chart, underwent a development process of practice, understanding, repractice and reunderstanding. it worked on oil managing, parameter adjusting, pump changing, yields incresing and inject increasing
它經歷了人工目測、星相圖、泵況圖三個發展階段,經歷了從實踐到認識,到再實踐、再認識的發展歷程,為油田的生產管理、調參換泵,增產增注,起到了輔助支持的作用。 -
The deadlock - free behavioral routing algorithm on star graph
星形圖上無死鎖的路徑演算法 -
This paper analyses and studies the design method of optical divide ratio of two way optical distributor in star optical fiber transport network, reaches a simple method to design optical divide ratio of two optical distributor : tabulated solution method and graph method, and then analyses and summarizes the characteristic and law of function curve, the five - point conclusion are presented finally
摘要對星形光纖傳輸網路中的光二分路器分光比的設計作了分析和研究,得到一種設計光二分路器分光比的簡便方法查表法和曲線圖解法,並對相關函數關系及其曲線特徵與規律作了分析,得出了5條結論。 -
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 , -
Identification of gasoline by its star - shaped graph
汽油油源的星狀圖鑒定法 -
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
本文主要討論了關于組合星圖反饋結點集的下界問題,在基於組合星圖的性質和已有相關結果的基礎上,給出了組合星圖反饋結點集的新的下界。 -
If the graph of the card is a star, the audience can take off the rubber band and it will change to a shape of star
這是一張星形的圖案,最後請觀眾拿下手腕上的橡皮筋,結果橡皮筋居然變成了星形的形狀! -
Proved that kn - h has an ascending star decomposition when the size of h is less than 4p, where h is a subgraph of the complete graph kn
當n階完全圖凡的子圖h的邊數小於了時kn ? h有星升分解? 12引進了慧星的概念並證明了以下結果
分享友人