Graph Operations Decreasing Values of Degree-Based Graph Entropies
From MaRDI portal
Publication:5050775
Recommendations
- The effect of graph operations on the degree-based entropy
- Graph operations based on using distance-based graph entropies
- Generalized degree-based graph entropies
- Extremality of degree-based graph entropies
- On the extremal values of general degree-based graph entropies
- scientific article; zbMATH DE number 167195
- First degree-based entropy of graphs
- A lower bound on graph entropy
- scientific article; zbMATH DE number 7410277
- Entropy and the complexity of graphs revisited
Cites work
- A history of graph entropy measures
- Extremality of degree-based graph entropies
- Graph operations based on using distance-based graph entropies
- scientific article; zbMATH DE number 7410277 (Why is no real title available?)
- Information processing in complex networks: Graph entropy and information functionals
- Maximum values of degree-based entropies of bipartite graphs
- Network entropies based on independent sets and matchings
- On extremal properties of graph entropies
- On the distance based graph entropies
- Topological structure of extremal graphs on the first degree-based graph entropies
Cited in
(5)- The effect of graph operations on the degree-based entropy
- Entropy approach through graph theory for studying the degree of order in one-dimensional distributions of objects
- On extremal cacti with respect to the first degree-based entropy
- On the minimality of degree-based graph entropy for connected graphs
- Minimal degree-based graph entropy for dense graphs
This page was built for publication: Graph Operations Decreasing Values of Degree-Based Graph Entropies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050775)