Extremality of degree-based graph entropies

DOI10.1016/J.INS.2014.03.133zbMath1354.94018OpenAlexW2065685908MaRDI QIDQ506695

Yongtang Shi, Matthias Dehmer, Shu-Juan Cao

Publication date: 2 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.03.133

zbMATH Keywords

entropyinformation theorygraph entropydegree sequenceShannon's entropydegree power

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Measures of information, entropy (94A17)

Related Items (55)

Entropy bounds for dendrimers ⋮ Entropy of weighted graphs with Randić weights ⋮ New inequalities for network distance measures by using graph spectra ⋮ Resolution of Yan's Conjecture on Entropy of Graphs ⋮ Graph Operations Decreasing Values of Degree-Based Graph Entropies ⋮ Degree-based entropies of networks revisited ⋮ Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions ⋮ Inertia of complex unit gain graphs ⋮ Further results on digraphs with completely real Laplacian spectra ⋮ Bounds for degree-based network entropies ⋮ Note on two generalizations of the Randić index ⋮ On graph entropy measures based on the number of independent sets and matchings ⋮ On topological properties of degree-based entropy of hex-derived network of type 3 ⋮ Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\) ⋮ On measuring the complexity of networks: Kolmogorov complexity versus entropy ⋮ The augmented Zagreb indices of fluoranthene-type benzenoid systems ⋮ On extremal cacti with respect to the first degree-based entropy ⋮ Wiener polarity index of dendrimers ⋮ Topological indices and graph entropies for carbon nanotube Y-junctions ⋮ The greatest values for atom-bond sum-connectivity index of graphs with given parameters ⋮ Spectral properties of inverse sum indeg index of graphs ⋮ On the degeneracy of the Randić entropy and related graph measures ⋮ A polynomial algorithm of edge-neighbor-scattering number of trees ⋮ On Steiner degree distance of trees ⋮ Odd components of co-trees and graph embeddings ⋮ New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks ⋮ A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration ⋮ Counterexamples to conjectures on graph distance measures based on topological indexes ⋮ Network entropies based on independent sets and matchings ⋮ On the general trigonometric sums weighted by character sums ⋮ Finding a shortest cycle in a subspace of the cycle space of a graph ⋮ Second order Randić index of fluoranthene-type benzenoid systems ⋮ On a problem analogues to Lehmer's and Hurwitz zeta-function ⋮ The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies ⋮ The general connectivity indices of fluoranthene-type benzenoid systems ⋮ Extremal values of matching energies of one class of graphs ⋮ Hermitian Laplacian matrix and positive of mixed graphs ⋮ On the distance based graph entropies ⋮ A lower bound of revised Szeged index of bicyclic graphs ⋮ Effect of clustering on attack vulnerability of interdependent scale-free networks ⋮ Maximum values of degree-based entropies of bipartite graphs ⋮ Some bounds of weighted entropies with augmented Zagreb index edge weights ⋮ Some new bounds of weighted graph entropies with GA and Gaurava indices edge weights ⋮ A note on extremal trees with degree conditions ⋮ On neighborhood inverse sum indeg index of molecular graphs with chemical significance ⋮ On the extremal values of general degree-based graph entropies ⋮ Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs ⋮ A comparative analysis of new graph distance measures and graph edit distance ⋮ New network entropy : The domination entropy of graphs ⋮ Extremality of graph entropy based on degrees of uniform hypergraphs with few edges ⋮ First degree-based entropy of graphs ⋮ Analyzing lattice networks through substructures ⋮ Generalized degree-based graph entropies ⋮ The effect of graph operations on the degree-based entropy ⋮ A note on Steiner reciprocal degree distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A history of graph entropy measures
• Degree powers in \(C_5\)-free graphs
• Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
• Structural information content of networks: graph entropy based on local vertex functionals
• Information processing in complex networks: Graph entropy and information functionals
• Number of walks and degree powers in a graph
• An inequality for degree sequences
• Two path extremal graphs and an application to a Ramsey-type problem
• Some bounds on entropy measures in information theory
• An upper bound on the sum of squares of degrees in a hypergraph
• A Turán type problem concerning the powers of the degrees of a graph
• An upper bound on the sum of squares of degrees in a graph
• Entropy lower bounds for quantum decision tree complexity
• An extremal problem on degree sequences of graphs
• Degree powers in graphs with forbidden subgraphs
• Degree powers in graphs with a forbidden even cycle
• On the variance of Shannon products of graphs
• Sums of powers of the degrees of a graph
• Advances in Network Complexity
• Degree Powers in Graphs: The Erdős–Stone Theorem
• Graph Energy
• On Sets of Acquaintances and Strangers at any Party
• Moments of graphs in monotone families
• Sum of squares of degrees in a graph
• Graphs with maximal number of adjacent pairs of edges
• Minimizer graphs for a class of extremal problems
• The variance of the vertex degrees of randomly generated graphs
• Elements of Information Theory
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
• Entropy and the complexity of graphs: III. Graphs with prescribed information content
• Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
• Wiener index of trees: Theory and applications

This page was built for publication: Extremality of degree-based graph entropies