FREQUENCY OF EVEN AND ODD NUMBERS IN DISTANCE MATRICES OF BIPARTITE GRAPHS

Authors
GUTMAN I
Citation
I. Gutman, FREQUENCY OF EVEN AND ODD NUMBERS IN DISTANCE MATRICES OF BIPARTITE GRAPHS, Journal of chemical information and computer sciences, 34(4), 1994, pp. 912-914
Citations number
6
Categorie Soggetti
Information Science & Library Science","Computer Application, Chemistry & Engineering","Computer Science Interdisciplinary Applications",Chemistry,"Computer Science Information Systems
Journal title
Journal of chemical information and computer sciences → ACNP
ISSN journal
00952338
Volume
34
Issue
4
Year of publication
1994
Pages
912 - 914
Database
ISI
SICI code
0095-2338(1994)34:4<912:FOEAON>2.0.ZU;2-7
Abstract
In a recent paper (Lukovits, I. J. Chem. Inf. Compyt. Sci. 1993, 33, 6 26-629) the frequency of even and odd numbers in distance matrices of trees was investigated. We now show that the regularities reported the re apply to all (connected) bipartite graphs. Moreover, these regulari ties am easily envisaged by taking into account certain general struct ural features of bipartite graphs.