超网络的有向k超树分析法
DIRECTED k-HYPERTREE METHOD FOR HYPERNETWORK ANALYSIS
-
摘要: 文中提出了有向超图理论,应用它导出了超网络的有向k超树分析法。应用该法可以扩大计算机所能拓扑分析的电网络的规模,而且表达式紧凑。
-
关键词:
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]黄汝激,电子科学学刊,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]陆生勋,电子科学学刊,5(1983), 210.[7]黄汝激,电子科学学刊,8(1986), 335.[8]黄汝激,混合图的有向k树多项式的产生和状态空间树,电子学报(即将发表). -
计量
- 文章访问数: 1772
- HTML全文浏览量: 98
- PDF下载量: 435
- 被引次数: 0
下载:
