超網(wǎng)絡(luò)的有向k超樹分析法
DIRECTED k-HYPERTREE METHOD FOR HYPERNETWORK ANALYSIS
-
摘要: 文中提出了有向超圖理論,應(yīng)用它導(dǎo)出了超網(wǎng)絡(luò)的有向k超樹分析法。應(yīng)用該法可以擴大計算機所能拓撲分析的電網(wǎng)絡(luò)的規(guī)模,而且表達式緊湊。
-
關(guān)鍵詞:
Abstract: The directed hypergraph theory is presented, and by applying it the directed k-hypertree method for hypernetwork analysis is derived. Using this method the scale of electrical networks which can be topologically analysed by a computer will be increased, and the resultant expressions are compact. -
C. Berge, Graph and Hypergraph, Amsterdam: North-Holland, 1973, Chs.3,17.[2]黃汝激,電子科學(xué)學(xué)刊,7(1985), 81.[3]W. K. Chen, Applied Graph Theory, Amsterdam: North-Holland, 1976. Chs.4,5.[4]M. N. S. Swamy, Graphs, Networks and Algorithms, New York, John Wiley and Sons, 1981, Ch. 4.[5]Daniel I. A. Cohen. Basic Techniques of Combinatorial Theory, New York, John Wiley and Sons, 1978, Ch.4. [6] W. K. Chen, IEEE Trans. on CT, CT-16(1969), 518.[6]陸生勛,電子科學(xué)學(xué)刊,5(1983), 210.[7]黃汝激,電子科學(xué)學(xué)刊,8(1986), 335.[8]黃汝激,混合圖的有向k樹多項式的產(chǎn)生和狀態(tài)空間樹,電子學(xué)報(即將發(fā)表). -
計量
- 文章訪問數(shù): 1792
- HTML全文瀏覽量: 103
- PDF下載量: 441
- 被引次數(shù): 0
下載:
