Add to ORKGWe define the Wiener-entropy, which is together with the eccentricity-entropy one of the most natural distance-based graph entropies. By deriving the (asymptotic) extremal behaviour, we conclude that the Wiener-entropy of graphs of a given order is more spread than is the case for the eccentricity-entropy. We solve $3$ conjectures on the eccentricity-entropy and give a conjecture on the Wiener-entropy related to some surprising behaviour on the graph minimizing it.Comment: 15 pages, 4 figures, 3 tables v2: computer verifications have been adde
A variety of problems in, e.g., discrete mathematics, computer science, information theory, statisti...
The purpose of this paper is to show : 1) that the set of all histories of a dynamical system at any...
We conjecture that all connected graphs of order n have von Neumann entropy at least as great as the...
This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to a...
The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized b...
Marginal entropy is one of the distances based on the graph entropy. Then, this entropy is computed ...
Shannon entropy is an information-theoretic measure of unpredictability in probabilistic models. Rec...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a ...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to a...
The concept of walk entropy of a graph has been recently introduced in E. Estrada et al. (2014) [4]....
Abstract. The concept of walk entropy of a graph has been recently introduced in [E. Estrada, J. A. ...
As entropy is also an important quantity in physics, we relate our results to physical processes by ...
A variety of problems in, e.g., discrete mathematics, computer science, information theory, statisti...
The purpose of this paper is to show : 1) that the set of all histories of a dynamical system at any...
We conjecture that all connected graphs of order n have von Neumann entropy at least as great as the...
This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to a...
The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized b...
Marginal entropy is one of the distances based on the graph entropy. Then, this entropy is computed ...
Shannon entropy is an information-theoretic measure of unpredictability in probabilistic models. Rec...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a ...
Many graph invariants have been used for the construction of entropy-based measures to characterize ...
In this paper, we study several distance-based entropy measures on fullerene graphs. These include t...
This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to a...
The concept of walk entropy of a graph has been recently introduced in E. Estrada et al. (2014) [4]....
Abstract. The concept of walk entropy of a graph has been recently introduced in [E. Estrada, J. A. ...
As entropy is also an important quantity in physics, we relate our results to physical processes by ...
A variety of problems in, e.g., discrete mathematics, computer science, information theory, statisti...
The purpose of this paper is to show : 1) that the set of all histories of a dynamical system at any...
We conjecture that all connected graphs of order n have von Neumann entropy at least as great as the...