The Library
PERFECT PAIRS OF TREES IN GRAPHS
Tools
UNSPECIFIED (1992) PERFECT PAIRS OF TREES IN GRAPHS. INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS, 20 (2). pp. 201-208.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Abstract
We introduce the concept of perfect pairs of trees of a graph as a natural generalization of so-called maximally distant pairs of trees. Several propositions and remarks are presented to display the properties of this new notion. Lemma 1, which plays a central role, gives five equivalent statements characterizing the relation 'to be maximally distant from' between pairs of trees. Symmetrization of this relation leads to our concept of a perfect pair of trees, the properties of which are given in Theorem 1. Remark 4 shows how naturally our new concept arises. Additionally, certain examples are provided to illustrate perfect pair structures in a graph.
Item Type: | Journal Item | ||||
---|---|---|---|---|---|
Subjects: | T Technology > TK Electrical engineering. Electronics Nuclear engineering | ||||
Journal or Publication Title: | INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS | ||||
Publisher: | JOHN WILEY & SONS LTD | ||||
ISSN: | 0098-9886 | ||||
Official Date: | March 1992 | ||||
Dates: |
|
||||
Volume: | 20 | ||||
Number: | 2 | ||||
Number of Pages: | 8 | ||||
Page Range: | pp. 201-208 | ||||
Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |