Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Entropy Measures of Distance Matrix

Version 1 : Received: 6 November 2021 / Approved: 8 November 2021 / Online: 8 November 2021 (13:33:09 CET)

How to cite: Şahin, B.; Şahi̇n, A. Entropy Measures of Distance Matrix. Preprints 2021, 2021110145 (doi: 10.20944/preprints202111.0145.v1). Şahin, B.; Şahi̇n, A. Entropy Measures of Distance Matrix. Preprints 2021, 2021110145 (doi: 10.20944/preprints202111.0145.v1).

Abstract

Bonchev and Trinajstic defined two distance based entropy measures to measure the molecular branching of molecular graphs in 1977 [Information theory, distance matrix, and molecular branching, J. Chem. Phys., 38 (1977), 4517–4533]. In this paper we use these entropy measures which are based on distance matrices of graphs. The first one is based on distribution of distances in distance matrix and the second one is based on distribution of distances in upper triangular submatrix. We obtain the two entropy measures of paths, stars, complete graphs, cycles and complete bipartite graphs. Finally we obtain the minimal trees with respect to these entropy measures with fixed diameter.

Keywords

Distance; Wiener Index; Distance Matrix; Entropy Measure

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.