Generalized degree-based graph entropies
From MaRDI portal
Publication:2333475
Summary: 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 by using the degree powers are proved. Moreover, the relationships among the entropies are studied. Finally, numerical results are presented to illustrate the features of the new entropies.
Recommendations
- Extremality of degree-based graph entropies
- Degree-based entropies of networks revisited
- Novel inequalities for generalized graph entropies -- graph energies and topological indices
- Topological structure of extremal graphs on the first degree-based graph entropies
- Bounds for degree-based network entropies
Cites work
- A history of graph entropy measures
- A lower bound for Laplacian Estrada index of a graph
- A new entropic method of dimensionality reduction specially designed for multiclass discrimination (DIRECLADIS)
- An exceptional property of first Zagreb index
- An upper bound on the sum of squares of degrees in a graph
- Bounds for degree-based network entropies
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
- Degree-based entropies of networks revisited
- Elements of Information Theory
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Estimating the Estrada index
- Extremality of degree-based graph entropies
- scientific article; zbMATH DE number 6704641 (Why is no real title available?)
- scientific article; zbMATH DE number 3173999 (Why is no real title available?)
- scientific article; zbMATH DE number 6271723 (Why is no real title available?)
- scientific article; zbMATH DE number 5259316 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- Information processing in complex networks: Graph entropy and information functionals
- Information theory of networks
- New upper bound and lower bound for degree-based network entropy
- Note on the HOMO-LUMO index of graphs
- On incidence energy
- On Laplacian energy
- On measures of information and their characterizations
- On molecular graphs with smallest and greatest zeroth-order general Randić index
- On segments, vertices of degree two and the first Zagreb index of trees
- On the measurable solution of a functional equation arising in information theory
- On Zagreb and Harary indices
- Quantitative methods for ecological network analysis
- Series expansion of the directed percolation probability
- Symmetry in complex networks
- Trees of given order and independence number with minimal first Zagreb index
- Trees with the first three smallest and largest generalized topological indices
- Zagreb indices of the generalized hierarchical product of graphs
Cited in
(18)- Novel inequalities for generalized graph entropies -- graph energies and topological indices
- Degree-based entropies of networks revisited
- Bounds for degree-based network entropies
- Network entropies based on independent sets and matchings
- New network entropy : The domination entropy of graphs
- Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels
- Curvature and entropy of a graph
- On the degeneracy of the Randić entropy and related graph measures
- New upper bound and lower bound for degree-based network entropy
- On graph entropy measures based on the number of independent sets and matchings
- Entropies of tailored random graph ensembles: bipartite graphs, generalized degrees, and node neighbourhoods
- Generalized entropies and open random and scale-free networks
- Graph Operations Decreasing Values of Degree-Based Graph Entropies
- Extremality of degree-based graph entropies
- DEGREE-BASED GINI INDEX FOR GRAPHS
- scientific article; zbMATH DE number 7410337 (Why is no real title available?)
- Graphical representation of the excess entropy
- Generalized entropy for random walks in regular networks and graphs as a super diffusion
This page was built for publication: Generalized degree-based graph entropies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333475)
