Entropy of Weighted Graphs with Randi´c Weights
AbstractShannon entropies for networks have been widely introduced. However, entropies for weighted graphs have been little investigated. Inspired by the work due to Eagle et al., we introduce the concept of graph entropy for special weighted graphs. Furthermore, we prove extremal properties by using elementary methods of classes of weighted graphs, and in particular, the one due to Bollobás and Erdös, which is also called the Randi´c weight. As a result, we derived statements on dendrimers that have been proven useful for applications. Finally, some open problems are presented. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Chen, Z.; Dehmer, M.; Emmert-Streib, F.; Shi, Y. Entropy of Weighted Graphs with Randi´c Weights. Entropy 2015, 17, 3710-3723.
Chen Z, Dehmer M, Emmert-Streib F, Shi Y. Entropy of Weighted Graphs with Randi´c Weights. Entropy. 2015; 17(6):3710-3723.Chicago/Turabian Style
Chen, Zengqiang; Dehmer, Matthias; Emmert-Streib, Frank; Shi, Yongtang. 2015. "Entropy of Weighted Graphs with Randi´c Weights." Entropy 17, no. 6: 3710-3723.