The Maximally and Minimally Distant Tree Pairs in the Equal Parameter Graphs and Their Applications in the Electrical Network Analysis
-
摘要: 本文推廣了線圖的樹對及其距離的概念,提出了等參數圖及其樹對和樹對之距離的概念。給出了等參數圖中任一樹對為一最大（或最小）距離樹對的充分必要條件和相應的算法,討論了等參數圖中最大與最小距離樹對在電網絡分析中的應用,給出了網絡圖主劃分算法1的對偶算法和電網絡的最優調和分解算法。Abstract: This paper develoPs the concepts of a pair of trees and their distance in a linear graph. The necessary and sufficient conditions for a maximally and minimally di'stant tree pair and the algorithms for finding a maximally and minimally distant tree pair are given. This paper also disccuses the applications of maximally and minimally distant tree pairs in equal parameter graphs in the electrical network analysis, and Presents the dual algorithm of Principal partition algithm 1 and the algrithm of oPtimal harmonious decomposition of electrical networks.
-
點擊查看大圖
計量
- 文章訪問數: 213
- HTML全文瀏覽量: 75
- PDF下載量: 8
- 被引次數: 0
下載:
