Graph operations based on using distance-based graph entropies
From MaRDI portal
Recommendations
Cites work
- A new method of measuring similarity for a special class of directed graphs
- Advances in network complexity
- Eccentric connectivity polynomial of some graph operations
- Entropy of weighted graphs with the degree-based topological indices as weights
- Graph distance measures based on topological indices revisited
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 7410277 (Why is no real title available?)
- scientific article; zbMATH DE number 7410337 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- Novel inequalities for generalized graph entropies -- graph energies and topological indices
- Randić index and information
Cited in
(5)- The entropy of weighted graphs with atomic bond connectivity edge weights
- Some bounds of weighted entropies with augmented Zagreb index edge weights
- A note on distance-based entropy of dendrimers
- Total eccentricity of some graph operations
- Graph Operations Decreasing Values of Degree-Based Graph Entropies
This page was built for publication: Graph operations based on using distance-based graph entropies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2335167)