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)
A peer-reviewed article of this Preprint also exists.
Entropy Measures of Distance Matrix. Discrete Mathematics Letters, 2022, 9, 72–79. https://doi.org/10.47443/dml.2021.s212. Entropy Measures of Distance Matrix. Discrete Mathematics Letters, 2022, 9, 72–79. https://doi.org/10.47443/dml.2021.s212.
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
Subject
Physical Sciences, Atomic and Molecular Physics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
