Extremality of degree-based graph entropies
From MaRDI portal
Publication:506695
DOI10.1016/J.INS.2014.03.133zbMATH Open1354.94018OpenAlexW2065685908MaRDI QIDQ506695FDOQ506695
Authors: 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
Recommendations
Applications of graph theory (05C90) Measures of information, entropy (94A17) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- Elements of Information Theory
- Title not available (Why is that?)
- Graph theory
- Graph energy
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph energy
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trees with the first three smallest and largest generalized topological indices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Wiener index of trees: Theory and applications
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- A history of graph entropy measures
- Information processing in complex networks: Graph entropy and information functionals
- Some bounds on entropy measures in information theory
- Entropy lower bounds for quantum decision tree complexity
- Graphs of extremal weights
- Advances in network complexity
- On extremal properties of graph entropies
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- Title not available (Why is that?)
- Graphs with maximal number of adjacent pairs of edges
- Title not available (Why is that?)
- 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
- Structural information content of networks: graph entropy based on local vertex functionals
- Degree powers in graphs: the Erdős-Stone theorem
- Degree powers in \(C_5\)-free graphs
- On Sets of Acquaintances and Strangers at any Party
- Information theory of complex networks: on evolution and architectural constraints
- Number of walks and degree powers in a graph
- An upper bound on the sum of squares of degrees in a graph
- Sum of squares of degrees in a graph
- On history of the Randić index and emerging hostility toward chemical graph theory
- Sums of powers of the degrees of a graph
- Minimizer graphs for a class of extremal problems
- An inequality for degree sequences
- An upper bound on the sum of squares of degrees in a hypergraph
- Two path extremal graphs and an application to a Ramsey-type problem
- A Turán type problem concerning the powers of the degrees of a graph
- 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
- Graphs with large variance.
- Recent developments in extremal combinatorics: Ramsey and Turán type problems
- Moments of graphs in monotone families
- Title not available (Why is that?)
- The variance of the vertex degrees of randomly generated graphs
- Title not available (Why is that?)
Cited In (69)
- Maximum values of degree-based entropies of bipartite graphs
- A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
- Second order Randić index of fluoranthene-type benzenoid systems
- A polynomial algorithm of edge-neighbor-scattering number of trees
- Odd components of co-trees and graph embeddings
- Note on two generalizations of the Randić index
- Novel inequalities for generalized graph entropies -- graph energies and topological indices
- Bounds for degree-based network entropies
- Counterexamples to conjectures on graph distance measures based on topological indexes
- 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
- Entropy of weighted graphs with the degree-based topological indices as weights
- Graph properties, graph limits, and entropy
- Entropy bounds for dendrimers
- A history of graph entropy measures
- On the extremal values of general degree-based graph entropies
- Title not available (Why is that?)
- New inequalities for network distance measures by using graph spectra
- A note on extremal trees with degree conditions
- The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
- Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs
- Spectral properties of inverse sum indeg index of graphs
- Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions
- Analyzing lattice networks through substructures
- New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks
- Entropy of weighted graphs with Randić weights
- Further results on digraphs with completely real Laplacian spectra
- Inertia of complex unit gain graphs
- Hermitian Laplacian matrix and positive of mixed graphs
- A lower bound of revised Szeged index of bicyclic graphs
- Degree-based entropies of networks revisited
- The augmented Zagreb indices of fluoranthene-type benzenoid systems
- On the degeneracy of the Randić entropy and related graph measures
- New network entropy : The domination entropy of graphs
- Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\)
- First degree-based entropy of graphs
- On measuring the complexity of networks: Kolmogorov complexity versus entropy
- A comparative analysis of new graph distance measures and graph edit distance
- Network entropies based on independent sets and matchings
- On sphere-regular graphs and the extremality of information-theoretic network measures
- On extremal properties of graph entropies
- On Steiner degree distance of trees
- On graph entropy measures based on the number of independent sets and matchings
- Wiener polarity index of dendrimers
- Effect of clustering on attack vulnerability of interdependent scale-free networks
- Finding a shortest cycle in a subspace of the cycle space of a graph
- On the general trigonometric sums weighted by character sums
- On a problem analogues to Lehmer's and Hurwitz zeta-function
- Extremal values of matching energies of one class of graphs
- On the distance based graph entropies
- The general connectivity indices of fluoranthene-type benzenoid systems
- Topological structure of extremal graphs on the first degree-based graph entropies
- The effect of graph operations on the degree-based entropy
- Graphs with minimum degree-entropy
- Extremal values of degree-based entropies of bipartite graphs
- Topological indices and graph entropies for carbon nanotube Y-junctions
- Generalized degree-based graph entropies
- Resolution of Yan's conjecture on entropy of graphs
- New upper bound and lower bound for degree-based network entropy
- A note on Steiner reciprocal degree distance
- On neighborhood inverse sum indeg index of molecular graphs with chemical significance
- Title not available (Why is that?)
- A note on extremality of the first degree-based entropy
- The greatest values for atom-bond sum-connectivity index of graphs with given parameters
- On extremal cacti with respect to the first degree-based entropy
- On topological properties of degree-based entropy of hex-derived network of type 3
- Graph Operations Decreasing Values of Degree-Based Graph Entropies
- Extremality of graph entropy based on Laplacian degrees of \(k\)-uniform hypergraphs
- Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
This page was built for publication: Extremality of degree-based graph entropies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506695)
