Equiseparable chemical trees

Let n1(e|T) and n2(e|T) denote the number of vertices of a tree T, lying on the two sides of the edge e. Let T1 and T2 be two trees with equal number of vertices, let e be an edge of T1 and f an edge of T2. Then e and f are said to be equiseparable if either n1(e|T1) = n1(e|T2) or n1(e|T1) = n2(e|T2...

Full description

Bibliographic Details
Main Authors: BORIS FURTULA, IVAN GUTMAN, BILJANA ARSIC
Format: Article
Language:English
Published: Serbian Chemical Society 2003-07-01
Series:Journal of the Serbian Chemical Society
Subjects:
Online Access:http://www.shd.org.yu/HtDocs/SHD/Vol68/No7/V68-No7-05.pdf