On Extremal Properties of Graph Entropies
نویسندگان
چکیده
Institute for Bioinformatics and Translational Research, UMIT, Eduard Wallnoefer Zentrum 1, 6060 Hall in Tyrol, Austria Email: {matthias.dehmer, veronika.kraus}@umit.at (Received May 2, 2012) Abstract We study extremal properties of graph entropies based on so-called information functionals. We obtain some extremality results for the resulting graph entropies which rely on the well-known Shannon entropy. Also by applying these results, we infer some entropy bounds for certain graph classes. Further, conjectures to determine extremal values (maximum and minimum values) of the graph entropies graphs based on numerical results are given.
منابع مشابه
Generalized Degree-Based Graph Entropies
Inspired by the generalized entropies for graphs, a class of generalized degree-based graph entropies is proposed using the known information-theoretic measures to characterize the structure of complex networks. The new entropies depend on assigning a probability distribution about the degrees to a network. In this paper, some extremal properties of the generalized degree-based graph entropies ...
متن کاملA survey of recent results in (generalized) graph entropies
The entropy of a graph was first introduced by Rashevsky [1] and Trucco [2] to interpret as the structural information content of the graph and serve as a complexity measure. In this paper, we first state a number of definitions of graph entropy measures and generalized graph entropies. Then we survey the known results about them from the following three respects: inequalities and extremal prop...
متن کاملOn Sphere-Regular Graphs and the Extremality of Information-Theoretic Network Measures
Veronika Kraus, Matthias Dehmer, Michael Schutte Institute for Bioinformatics and Translational Research, UMIT, Eduard Wallnoefer Zentrum 1, 6060 Hall in Tyrol, Austria. {veronika.kraus, matthias.dehmer,michael.schutte}@umit.at (Received June 2, 2013) Abstract The entropy of a chemical graph can be interpreted as its structural information content. In this paper, we study extremality properties...
متن کاملEntropy of Weighted Graphs with Randi'c Weights
Shannon entropies for networks have been widely introduced. However, entropies for weighted graphs have been little investigated. Inspired by the work due to Eagle et al., we introduce the concept of graph entropy for special weighted graphs. Furthermore, we prove extremal properties by using elementary methods of classes of weighted graphs, and in particular, the one due to Bollobás and Erdös,...
متن کاملThe Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کامل