正則圖 的英文怎麼說
中文拼音 [zhēngzétú]
正則圖
英文
regular graph-
In this paper, we mainly study consecution of consecutive graph under several operations. also we determine bounds of irregularity strength and ( g ) for there classes of graphs
本文討論連續的圖在幾種圖運算下的連續性，證明了幾類特殊圖是連續的，並得到它們的非正則和以及非正則強度的界。Vertex pancyclicity in almost regular multipartite tournaments
幾乎正則多部競賽圖的點泛圈性In this paper, we study asec of a class r - regular partite for r - regular partite graph
摘要研究了一類正則二部圖的鄰強邊染色，驗證了文獻[ 1 ]中猜想是正確的。Regularization of dti images based on gaussian - mrf
圖像的正則化Whe a ew movement i art attai a certai fashion, it i advisable to find out what it advocate are aiming at, for, however farfetched and unreasonable their rinciple may eem today, it i o ible that i year to come they may e regarded a ormal
當藝術領域的一個新運動發展成某種流行時尚時，最好應該弄清這場運動倡導者的真正意圖，因為，不管他們的原則在今天看來多麼牽強無理，很可能多年以後他們的理論會被視為正常。When a new movement in art attai a certain fashion, it is advisable to find out what its advocates are aiming at, for, however farfetched and unreasonable their principles may seem today, it is po ible that in years to come they may be regarded as normal
當藝術領域的一個新運動發展成某種流行時尚時，最好應該弄清這場運動倡導者的真正意圖，因為，不管他們的原則在今天看來多麼牽強無理，很可能多年以後他們的理論會被視為正常。On the front panels of our new banknotes are the bauhinia and the bank of china tower while the back panels feature major landmark buildings in hong kong
新鈔正面圖案為紫荊花和中銀大廈，背面則以香港的著名建築物為主景。Aiming at this problem, the main research issues and achievements in this paper are as follows : bi - directional data transformation between rdb and xml with semantic constraints preserved for most of existing researches on static data transformation between xml and rdb, dtd is taken as the schema description language for xml, and the semantic constraints are often lost during the transformation process. to overcome these disadvantages, the author adopts xml - schema, a standard schema description language proposed by w3c to replace dtd, as the description method owing to its more powerful functions than dtd, and of course with the syntax much more complicated. after analyzing the constraints characteristics in both xml - schema and relational schema, a semantic constraints - preserved algorithm is proposed which can realize the bi - directional schema mapping between rdb and xml through a formalized description of xml based on regular tree and a general expression for relational schema based on direct graph approach
保留語義約束的xml與rdb雙向靜態數據轉換技術現有研究大多採用dtd （ documenttypedefinition ，文檔類型定義）作為xml的模式描述語言，並且在模式映射過程中丟失語義約束信息，本文分析了xml - schema （ xml - schema採用與dtd完全不同的語法，數據描述能力更強同時也更為復雜，已被w3c確定為替代dtd作為xml模式描述語言的標準）及關系模式的語義約束特徵，通過基於正則樹的xml形式化描述方法以及基於有向圖的一般關系模式表示方法的研究，建立保留語義約束的xml - schema與關系模式的雙向模式映射演算法，實現了xml與rdb的雙向數據轉換，較好地解決了xml與rdb在靜態數據轉換層面的數據集成問題，可有效滿足企業大量rdb數據面向xml的發布以及與日俱增的xml數據存入rdb的應用需求。A graph is regular if every vertex has the same degree.
如果一個圖的每個頂點都具有相同的度數，則稱它是正則圖。Rank of subdivision graphs of regular graphs
正則圖的剖分圖的秩In this paper, three correlative results are given : 1 ) the average crossing number of graph with n vertices and q edges can be signified approximately by quadratic equation of q. 2 ) the average crossing number of graphs with bigger girth is greater than that with smaller girth within given vertices and edges. 3 ) the average crossing number of r - regular graphs greater than that of non - regular graphs within given vertices and edges where n is odd or r < n / 2
並得出相關的規律： 1 ） n個頂點q條邊的單二連通分支圖的平均交叉數aac （ n ， q ）可近似地表示為q的二次多項式， 2 ）在給定頂點數n與邊數q的單二連通分支圖中圍長較大的圖的平均交叉數大於圍長較小的圖的平均交叉數， 3 ）在給定頂點數n與邊數q的單二連通分支圖中當n為奇數或r n / 2時， r正則圖的平均交叉數大於非r正則圖的平均交叉數。We also show strong edge chromatic number of two types of regular graphs with high degree and a note on a result of a. c. burris
給出了兩類高度正則圖的強邊色數，並對a . c . burris的一個結果進行了初步的探討。A linear algorithm for automatic generation and rectilinear embeddings of four regular graph
四正則圖的自動生成及縱橫嵌入的線性演算法We also calculate the average crossing number aac ( n ) of all of the 4 - regular graphs for n < 12 and the average crossing number arc ( n ) of some random 4 - regular graphs of degree 4 for n < 16. at the end of the paper, a conjecture that the average crossing number of regular graph of degree 4 is o ( n2 ) is given
同時計算出n 12的所有四正則圖的平均交叉數aac （ n ） ，和n 16的隨機四正則圖的平均交叉數arc （ n ） ，並根據計算結果提出四正則圖的平均交叉數為o （ n ~ 2 ）的猜想。By the algorithm ccn, we investigate the crossing numbers of regular graphs with small order. we get the crossing numbers of 3 - regular graphs for n < 16 and 4 - regular graphs for n < 12, and the lower bounds of the maximum crossing numbers of 3 - regular graphs for n < 30 and 4 - regular graphs for n < 19, where n is the order of graphs. according to the result, we put forward the conjecture about the maximum crossing numbers of regular graphs
本文還利用演算法ccn （ calculatecrossingnumber ）對頂點數較小的正則圖的交叉數進行研究，計算出n 16的三正則圖和n 12的四正則圖的交叉數，以及n 30的三正則圖和n 19的四正則圖的最大交叉數的下限（ n為圖的頂點個數） ，根據計算結果提出關于正則圖最大交叉數的猜想。It invests all 3 - regular graphs with order at most 18, all 3 - regular generalized petersen graphs with order at most 30, all 3 - regular graphs with maximum girth and order from 20 to 30, some random 3 - regular graphs with order from 20 to 30, and all circulant graphs cn ( l, k ) with order at most 18. in this article, it is shown that the average crossing number of 3 - regular graphs with biggest girth and order n ( 18 ) is greater than that of all 3 - regular graphs
通過研究n 15的所有三正則的廣義petersen圖p （ n ， k ） ， n 18的所有三正則圖， 20 n 30的隨機三正則圖與具有最大圍長的三正則圖， n 18的所有循環圖c _ n （ 1 ， k ） ，本文得到如下規律：對于給定的頂點數n （ n 18 ） ，具有最大圍長的三正則圖的平均交叉數大於所有三正則圖的平均交叉數。Ranks of strong product of regular graphs
正則圖的強積的秩Eigenpolynomial of the lattices in d - bounded distance - regular graph
界距離正則圖中一類格的特徵多項式Using the algorithm ccn ( calculate crossing number ), this article researches on the relation between the crossing number and girth of the 3 - regular graphs
利用計算交叉數的演算法ccn （ calculatecrossingnumber ） ，本文對三正則圖的交叉數與圍長的關系進行了深入的研究。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 -正則圖類，得到了確定這兩類圖的最小折數縱橫擴張的簡便演算法，並給出了這兩類圖的縱橫擴張的最小折數。分享友人