The aim of this report to solve the open problem suggested by Chen et al. We study the graph entropy with ABC edge weights and present bounds of it for connected graphs, regular graphs, complete bipartite graphs, chemical graphs, tree, unicyclic graphs, and star graphs. Moreover, we compute the graph entropy for some families of dendrimers
In this article, we discuss the problem of establishing relations between information measures for n...
The concept of walk entropy of a graph has been recently introduced in E. Estrada et al. (2014) [4]....
For measuring the complexity of a graph, an information-theoretic quantity, that is, entropy functio...
Shannon entropies for networks have been widely introduced. However, entropies for weighted graphs h...
The graph entropies inspired by Shannon’s entropy concept become the information-theoretic quantitie...
This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to a...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
Inspired by the problem of sensory coding in neuroscience, we study the maximum entropy distribution...
The degree-based entropy Id(G) of a graph G on m>0 edges is obtained from the well-known Shannon ent...
The entropy of a digraph is a fundamental measure that relates network coding, information theory, a...
In this article, we discuss the problem of establishing relations between information measures for n...
We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a ...
We conjecture that all connected graphs of order n have von Neumann entropy at least as great as the...
Abstract. The concept of walk entropy of a graph has been recently introduced in [E. Estrada, J. A. ...
AbstractIn this note, we consider the von Neumann entropy of a density matrix obtained by normalizin...
In this article, we discuss the problem of establishing relations between information measures for n...
The concept of walk entropy of a graph has been recently introduced in E. Estrada et al. (2014) [4]....
For measuring the complexity of a graph, an information-theoretic quantity, that is, entropy functio...
Shannon entropies for networks have been widely introduced. However, entropies for weighted graphs h...
The graph entropies inspired by Shannon’s entropy concept become the information-theoretic quantitie...
This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to a...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
Inspired by the problem of sensory coding in neuroscience, we study the maximum entropy distribution...
The degree-based entropy Id(G) of a graph G on m>0 edges is obtained from the well-known Shannon ent...
The entropy of a digraph is a fundamental measure that relates network coding, information theory, a...
In this article, we discuss the problem of establishing relations between information measures for n...
We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a ...
We conjecture that all connected graphs of order n have von Neumann entropy at least as great as the...
Abstract. The concept of walk entropy of a graph has been recently introduced in [E. Estrada, J. A. ...
AbstractIn this note, we consider the von Neumann entropy of a density matrix obtained by normalizin...
In this article, we discuss the problem of establishing relations between information measures for n...
The concept of walk entropy of a graph has been recently introduced in E. Estrada et al. (2014) [4]....
For measuring the complexity of a graph, an information-theoretic quantity, that is, entropy functio...