The Hosoya Entropy of a Graph
This paper demonstrates properties of Hosoya entropy, a quantitative measure of graph complexity based on a decomposition of the vertices linked to partial Hosoya polynomials. Connections between the information content of a graph and Hosoya entropy are established, and the special case of Hosoya en...
Main Authors: | Abbe Mowshowitz, Matthias Dehmer |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2015-03-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/17/3/1054 |
Similar Items
-
On Properties of Distance-Based Entropies on Fullerene Graphs
by: Modjtaba Ghorbani, et al.
Published: (2019-05-01) -
Hosoya Polynomials of Generalized Vertex Identified and Edge Introducing Graphs
by: Ahmed Ali, et al.
Published: (2013-09-01) -
Linear Algorithms for the Hosoya Index and Hosoya Matrix of a Tree
by: Aleksander Vesel
Published: (2021-01-01) -
Detour Hosoya Polynomials of Some Compound Graphs
by: Herish Abdullah, et al.
Published: (2010-06-01) -
Hosoya properties of the commuting graph associated with the group of symmetries
by: Abbas Ghulam, et al.
Published: (2021-06-01)