The paper gives a class 4-tight optimal double loop network infinite family 本文給出了一類4-緊優(yōu)的雙環(huán)網(wǎng)無限族。
The problem of finding optimal diameter double loop network with a fixed number of vertices has been widely studied by graph theory and computer science researchers 摘要找出給定頂點數(shù)的雙環(huán)網(wǎng)的最小直徑是圖論和計算機工作者重點研究的問題之一。
We mainly study the case / = 3, that is triple loop networks . the upper bounds for the diameters of triple loop networks are given . when n is limited, the conditions for the optimal triple loop networks are obtained 本文重點研究了l3的情形,即三環(huán)網(wǎng)絡(luò),給出其直徑的上界,并給出n不太大時,三環(huán)網(wǎng)絡(luò)取得最優(yōu)的一個條件
We mainly study the case / = 3, that is triple loop networks . the upper bounds for the diameters of triple loop networks are given . when n is limited, the conditions for the optimal triple loop networks are obtained 本文重點研究了l3的情形,即三環(huán)網(wǎng)絡(luò),給出其直徑的上界,并給出n不太大時,三環(huán)網(wǎng)絡(luò)取得最優(yōu)的一個條件
We mainly study the case / = 3, that is triple loop networks . the upper bounds for the diameters of triple loop networks are given . when n is limited, the conditions for the optimal triple loop networks are obtained 本文重點研究了l3的情形,即三環(huán)網(wǎng)絡(luò),給出其直徑的上界,并給出n不太大時,三環(huán)網(wǎng)絡(luò)取得最優(yōu)的一個條件
5 the optimal design mathematics models and calculations of the single source looped network which source pressure is undecided and the single source looped network which source pressure is decided are presented respectively 5分別建立了水源水壓已定單水源環(huán)狀管網(wǎng)和水源水壓未定單水源環(huán)狀管網(wǎng)優(yōu)化設(shè)計數(shù)學模型,并提出了計算方法。