Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/16215
Title: | Perfect pairs of trees in graphs | Authors: | Novak, Ladislav Gibbons, Alan |
Issue Date: | 1-Jan-1992 | Journal: | International Journal of Circuit Theory and Applications | 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. Copyright © 1992 John Wiley & Sons, Ltd. | URI: | https://open.uns.ac.rs/handle/123456789/16215 | ISSN: | 00989886 | DOI: | 10.1002/cta.4490200206 |
Appears in Collections: | Naučne i umetničke publikacije |
Show full item record
SCOPUSTM
Citations
2
checked on May 10, 2024
Page view(s)
16
Last Week
5
5
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.