競賽圖 的英文怎麼說

中文拼音 [jìngsàitú]
競賽圖 英文
tournament
  • 競 : 動詞（競爭; 競賽） compete; contest; vie Ⅱ形容詞[書面語] （強勁） strong; powerful
  • 賽 : Ⅰ動詞1 （比賽） match; compete; contest 2 （勝; 比得上） be comparable to ; surpass Ⅱ名詞1 （比賽...
  • 圖 : Ⅰ名詞1 （繪畫表現出的形象; 圖畫） picture; chart; drawing; map 2 （計劃） plan; scheme; attempt 3...
  • 競賽 : contest; competition; emulation; race
  1. Vertex pancyclicity in almost regular multipartite tournaments

    幾乎正則多部競賽圖的點泛圈性
  2. The two theorems above give a complete solution of the problem of complementary cycles in tournaments. however, for multipartite tournaments which are not tournaments, the problem of complementary cycles is still open

    以上兩個定理已經完全解決了競賽圖的共軛圈問題，而多部競賽圖的共軛圈問題尚未解決。
  3. In this paper, we extend the theorem of song to multipartite tournaments and prove that every 2 - connected and 2 - equilibrium multipartite tournament contains a pair of componentwise complementary cycles, unless it is isomorphic to t71 ( see figure in ? )

    本文將競賽圖的結果推廣到均勻多部競賽圖上，並證明了2 -強連通2 -均勻多部競賽圖包含一對分量共軛圈，除非它同構于競賽圖t _ 7 ~ 1 （參看圖1 ） 。
  4. An orientation of a complete graph is called a tournament.

    完全圖的定向圖稱為競賽圖。
  5. Every tournament can be transformed into a diconnected tournament by the reorientation of just one arc.

    每個競賽圖只通過一條弧的改向而轉變為雙向連通競賽圖。
  6. Infinite - dimensional linear systems is now an established area of research with a long list of journal articles, conference proceedings, and several textbooks to its credit

    ， 99 （ 2000 ） ， 245 - 249 。這里，我們把yao等人的結果推廣到局部競賽圖中，並得到一個非常有意義的定理。
  7. Meanwhile, shanghai meining computer software co. ltd. s " stock information enquiry ", lingtong net s " ring tone graphics downloading ", wangda group s " mobile office ", beijing yisuode technology co. ltd. and go2map software beijing co. ltd. s " mobile locating system application - crystal ball " and beijing qunsheng technology co. ltd. s " games " won special nomination prizes in this competition

    同時，上海美寧計算機軟體有限公司"股票信息查詢"靈通網"鈴聲圖片下載"網達集團"移動辦公"北京易索得科技有限責任公司及新圖行天下軟體北京有限公司"移動定位系統應用-水晶球"北京群勝網科技有限公司"游戲"等5家公司提交的應用也在此競賽中分別獲得了特別提名獎。
  8. Enumeration formula of nonisomorphic and selfcomplementary tournaments

    不同構自補競賽圖的計數公式
  9. A note on posets and tournaments

    有關偏序集與競賽圖的討論
  10. In chapter i, we mainly study the pancyclicity of arcs in local tournaments

    在第一章我們主要研究局部競賽圖中的點外弧泛圈性問題。
  11. In this paper, we study the transitive properties of bipartite tournaments and tournaments, and give the sufficient and necessary conditions of them

    摘要研究了二部競賽圖和競賽圖的傳遞性，給出了它的充分必要條件。
  12. According to the ranking method of tournament graph, we offer a method to solve multiple attribute decision making problems with the information of plans ' preference for each object

    摘要對一類已知各方案對每個目標的優先次序的多屬性決策問題，借鑒競賽圖的排序方法，提出了確定所有方案總排序的競賽圖法。
  13. In 1991, hugh loebner started the loebner prize competition, offering a $ 100, 000 prize to the author of the first computer program to pass an unrestricted turing test

    1991年，休.羅布爾發起了羅布爾獎競賽，為第一個能夠通過無限制圖靈測試的計算機程序的作者提供10萬美元的獎金。
  14. The application and usage of the look of games graphics as designed by the ocog for operational and other areas such as concessions / concessions, field of play and spectator areas

    在運行區域和其他諸如特許經營點、競賽場地、觀眾區等區域使用由奧運會組織委員會設計的奧運會景觀圖案。
  15. The specimen impression of the special postmark of " dragon boat races " to be introduced on 25 june 2001

    圖示將於二一年六月二十五日推出的特別郵戳，主題為"龍舟競賽" 。
  16. The enclosed photograph shows a souvenir sheet to be issued on 25 june 2001 on the theme of " dragon boat races "

    圖示將於二一年六月二十五日推出的小型張，主題為"龍舟競賽" 。
  17. Some problems of the graph theory in the maths contest

    數學競賽中的圖論問題
  18. The relaxed game chromatic number of tree, outerplanar graphs, partial k - tree and pseudo partial k - tree have been studied by many researchers home and abroad, this paper further studied the relaxed game chromatic number of partial k - tree based on the known research, according to appling a new activation strategy, we proved if the relaxed degree d > 2k + 1, then for this ( r, d ) - relaxed coloring game, we have ( 2k + 1 ) - xg ( g ) < k + 1, it is an improvement about the result in paper [ 2 ]

    對樹，外平面圖，偏k -樹及偽偏k -樹的鬆弛競賽染色已在不同程度上得到了一些研究，並取得了一些相應的結果。本文正是在已有研究的基礎上，對偏k -樹的鬆弛競賽色數進行了進一步的研究，使得在鬆弛度d不小於2k + 1的情況下，對這個（ r ， d ） -鬆弛競賽染色，有，它是文章[ 2 ]中結果的一個很好的改進。
  19. Cambodian villagers fish near mekong river on the outskirts of phnom penh november 4, 2005. the three - day annual water festival with boat racing competitions will take place on november 15 - 17

    11月15 - 17日是柬埔寨的潑水節，每年潑水節還會舉辦泛舟競賽。圖為柬埔寨村民在金邊市郊的湄公河附近捕魚。
  20. In 1980, thomassen proved that every strong tournament contains a vertex v such that each out - arc of v is contained in a hamiltonian cycle, ( see [ 6 ] )

    1980年， thomassen證明了每一個強連通的競賽圖都包含一個頂點使得這個點的所有外弧都在hailtonian圈上，參看c . thomassen ， hamiltonian - connectedtournament ， j
分享友人
分享到 Line

分享到臉書