Toward Reconstruction of Trees by Using Graph Invariants

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The endpoint-endpoint distances of a tree were used together with the endpoint-branching point distances to reconstruct the underlying tree. The concept of triads and triangles (i.e. existing triads), composed of three endpoint-endpoint distances, was introduced. Each triangle defines a skeleton, that is a part of the underlying graph, and each skeleton defines a triangle uniquely. Several rules were derived, which can be used to eliminate irrelevant triads. A numerical example for a tree containing five endpoints has been worked out.

Original languageEnglish
Pages (from-to)287-289
Number of pages3
JournalJournal of Chemical Information and Computer Sciences
Volume34
Issue number2
DOIs
Publication statusPublished - Mar 1 1994

    Fingerprint

ASJC Scopus subject areas

  • Chemistry(all)
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this