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 entropy of trees is investigated
The degree-based entropy Id(G) of a graph G on m>0 edges is obtained from the well-known Shannon ent...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
This paper demonstrates properties of Hosoya entropy, a quantitative measure of graph complexity bas...
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a grap...
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a grap...
In this paper we extend earlier results on Hosoya entropy (H-entropy) of graphs, and establish conne...
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a grap...
http://deepblue.lib.umich.edu/bitstream/2027.42/6710/5/bad0194.0001.001.pdfhttp://deepblue.lib.umich...
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener ...
For measuring the complexity of a graph, an information-theoretic quantity, that is, entropy functio...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
Afullerene is a cubic three-connected graph whose faces are entirely composed of pentagons and hexag...
Combinatoric measures of entropy capture the complexity of a graph but rely upon the calculation of ...
Information-theoretic-based measures have been useful in quantifying network complexity. Here we bri...
The degree-based entropy Id(G) of a graph G on m>0 edges is obtained from the well-known Shannon ent...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
This paper demonstrates properties of Hosoya entropy, a quantitative measure of graph complexity bas...
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a grap...
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a grap...
In this paper we extend earlier results on Hosoya entropy (H-entropy) of graphs, and establish conne...
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a grap...
http://deepblue.lib.umich.edu/bitstream/2027.42/6710/5/bad0194.0001.001.pdfhttp://deepblue.lib.umich...
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener ...
For measuring the complexity of a graph, an information-theoretic quantity, that is, entropy functio...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
Afullerene is a cubic three-connected graph whose faces are entirely composed of pentagons and hexag...
Combinatoric measures of entropy capture the complexity of a graph but rely upon the calculation of ...
Information-theoretic-based measures have been useful in quantifying network complexity. Here we bri...
The degree-based entropy Id(G) of a graph G on m>0 edges is obtained from the well-known Shannon ent...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
DOI
Add to ORKG