The Maximally and Minimally Distant Tree Pairs in the Equal Parameter Graphs and Their Applications in the Electrical Network Analysis

Mu Zhen; Huang Ruji

doi:10.13374/j.issn1001-053x.1987.02.009

Volume 9 Issue 2

Oct. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 1987 > 9(2): 62-68

Mu Zhen, Huang Ruji. The Maximally and Minimally Distant Tree Pairs in the Equal Parameter Graphs and Their Applications in the Electrical Network Analysis[J]. Chinese Journal of Engineering, 1987, 9(2): 62-68. doi: 10.13374/j.issn1001-053x.1987.02.009

Citation:

Mu Zhen, Huang Ruji. The Maximally and Minimally Distant Tree Pairs in the Equal Parameter Graphs and Their Applications in the Electrical Network Analysis[J]. Chinese Journal of Engineering, 1987, 9(2): 62-68. doi: 10.13374/j.issn1001-053x.1987.02.009

Citation:

PDF( 584 KB)

The Maximally and Minimally Distant Tree Pairs in the Equal Parameter Graphs and Their Applications in the Electrical Network Analysis

doi: 10.13374/j.issn1001-053x.1987.02.009

Mu Zhen¹,
Huang Ruji²

Received Date: 1986-03-20
Available Online: 2021-10-28

Abstract

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.
- electrical network,
- equal parameter graph,
- harmonious and decomposition,
- maximally （minimally） distant tree pair