MAXIMALLY DISTANT TREES AND PRINCIPAL PARTITION OF A LINEAR GRAPH

被引：27

作者：

KISHI, G

KAJITANI, Y

机构：

[1] Department of Electrical Engineering, Tokyo Institute of Technology, Meguro-ku, Tokyo

来源：

IEEE TRANSACTIONS ON CIRCUIT THEORY | 1969年 / CT16卷 / 03期

关键词：

D O I：

10.1109/TCT.1969.1082966

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A pair of trees of a graph is said to be maximally distant if the distance between these trees is maximum in the graph. Necessary and sufficient conditions for maximally distant trees are presented. Fundamental properties of the maximally distant trees provide us with the principal partition of a graph that is uniquely determined for the graph. Some useful properties of the principal partition, together with the application to the classification of the trees, are discussed. © 1961, IEEE. All Rights Reserved.

引用

页码：323 / &

共 9 条

[1]

CUMMINS RL, 1966, IEEE T CIRCUIT THEOR, VCT13, P82

[2]

DEO N, 1966, IEEE T CIRCUIT THEOR, VCT13, P439

[3]

GUILLEMIN E, 1953, INTRODUCTORY CIRCUIT

[4] ON TREES OF A GRAPH AND THEIR GENERATION [J].

HAKIMI, SL .

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1961, 272 (05) :347-&

[5]

KAMAE T, 1967, IEEE T CIRCUIT THEOR, VCT14, P279

[6]

KISHI G, 1967, 5TH P ALL C CIRC SYS, P635

[7]

KISHI G, 1968, IEEE T CIRCUIT THEOR, VCT15, P42

[8]

LEE HB, 1965, IEEE T, VCT12, P365

[9]

TSUCHIYA G, 1967, 5 P ANN ALL C CIRC S, P644

← 1 →