Frequency of even and odd numbers in distance matrices of trees

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The frequency of even and odd numbers in distance matrices of acyclic graphs was investigated. The concept of a triad, made up of distances between three points, was introduced. It was shown that only two classes of triads are allowed, namely even-even-even and even-odd-odd. On the basis of this result, the allowed frequencies of even and odd numbers in arbitrary distance matrices could be determined. Expressions providing the number of eee-triads, eoo-triads, emon and en-1om+1 vertices were also given.

Original languageEnglish
Pages (from-to)626-629
Number of pages4
JournalJournal of Chemical Information and Computer Sciences
Volume33
Issue number4
Publication statusPublished - 1993

ASJC Scopus subject areas

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

Cite this

Frequency of even and odd numbers in distance matrices of trees. / Lukovits, I.

In: Journal of Chemical Information and Computer Sciences, Vol. 33, No. 4, 1993, p. 626-629.

Research output: Contribution to journalArticle

@article{ef34306361c04d2c8bb4afca056f37f7,
title = "Frequency of even and odd numbers in distance matrices of trees",
abstract = "The frequency of even and odd numbers in distance matrices of acyclic graphs was investigated. The concept of a triad, made up of distances between three points, was introduced. It was shown that only two classes of triads are allowed, namely even-even-even and even-odd-odd. On the basis of this result, the allowed frequencies of even and odd numbers in arbitrary distance matrices could be determined. Expressions providing the number of eee-triads, eoo-triads, emon and en-1om+1 vertices were also given.",
author = "I. Lukovits",
year = "1993",
language = "English",
volume = "33",
pages = "626--629",
journal = "Journal of Chemical Information and Modeling",
issn = "1549-9596",
publisher = "American Chemical Society",
number = "4",

}

TY - JOUR

T1 - Frequency of even and odd numbers in distance matrices of trees

AU - Lukovits, I.

PY - 1993

Y1 - 1993

N2 - The frequency of even and odd numbers in distance matrices of acyclic graphs was investigated. The concept of a triad, made up of distances between three points, was introduced. It was shown that only two classes of triads are allowed, namely even-even-even and even-odd-odd. On the basis of this result, the allowed frequencies of even and odd numbers in arbitrary distance matrices could be determined. Expressions providing the number of eee-triads, eoo-triads, emon and en-1om+1 vertices were also given.

AB - The frequency of even and odd numbers in distance matrices of acyclic graphs was investigated. The concept of a triad, made up of distances between three points, was introduced. It was shown that only two classes of triads are allowed, namely even-even-even and even-odd-odd. On the basis of this result, the allowed frequencies of even and odd numbers in arbitrary distance matrices could be determined. Expressions providing the number of eee-triads, eoo-triads, emon and en-1om+1 vertices were also given.

UR - http://www.scopus.com/inward/record.url?scp=0342411061&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0342411061&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0342411061

VL - 33

SP - 626

EP - 629

JO - Journal of Chemical Information and Modeling

JF - Journal of Chemical Information and Modeling

SN - 1549-9596

IS - 4

ER -