This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to all graphs representing the isomers of octane. Taking into account the vertex degree as well (degree-ecc-entropy), we find a good correlation with the acentric factor of octane isomers. In particular, we compute the degree-ecc-entropy for three classes of dendrimer graphs.Peer reviewe
In this paper, five degree based topological indices, the first Zagreb (M1), second Zagreb (M2), fir...
A family of chemical compounds known as metal–organic networks (MONs) is composed mainly of clusters...
Afullerene is a cubic three-connected graph whose faces are entirely composed of pentagons and hexag...
This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to a...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
A variety of problems in, e.g., discrete mathematics, computer science, information theory, statisti...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
The aim of this report to solve the open problem suggested by Chen et al. We study the graph entropy...
We define the Wiener-entropy, which is together with the eccentricity-entropy one of the most natura...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
Subgraphs can results through application of criteria based on matrix which characterize the entire ...
The degree-based entropy Id(G) of a graph G on m>0 edges is obtained from the well-known Shannon ent...
In graph theory, a topological index is a numerical value that is in good correlation with certain p...
The graph entropies inspired by Shannon’s entropy concept become the information-theoretic quantitie...
In this paper, we define some new distance-based graph measures and explore various properties. In p...
In this paper, five degree based topological indices, the first Zagreb (M1), second Zagreb (M2), fir...
A family of chemical compounds known as metal–organic networks (MONs) is composed mainly of clusters...
Afullerene is a cubic three-connected graph whose faces are entirely composed of pentagons and hexag...
This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to a...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
A variety of problems in, e.g., discrete mathematics, computer science, information theory, statisti...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
The aim of this report to solve the open problem suggested by Chen et al. We study the graph entropy...
We define the Wiener-entropy, which is together with the eccentricity-entropy one of the most natura...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
Subgraphs can results through application of criteria based on matrix which characterize the entire ...
The degree-based entropy Id(G) of a graph G on m>0 edges is obtained from the well-known Shannon ent...
In graph theory, a topological index is a numerical value that is in good correlation with certain p...
The graph entropies inspired by Shannon’s entropy concept become the information-theoretic quantitie...
In this paper, we define some new distance-based graph measures and explore various properties. In p...
In this paper, five degree based topological indices, the first Zagreb (M1), second Zagreb (M2), fir...
A family of chemical compounds known as metal–organic networks (MONs) is composed mainly of clusters...
Afullerene is a cubic three-connected graph whose faces are entirely composed of pentagons and hexag...