4.6 Article

Entropy of Weighted Graphs with Randic Weights

Journal

ENTROPY
Volume 17, Issue 6, Pages 3710-3723

Publisher

MDPI
DOI: 10.3390/e17063710

Keywords

Shannon's entropy; graph entropy; weighted graphs; extremal value; Randi weight

Funding

  1. Austrian Science Funds [P26142]
  2. German Federal Ministry of Education and Research (BMBF) (Project RiKoV) [13N12304]
  3. National Science Foundation of China [61174094]
  4. Natural Science Foundation of Tianjin [14JCYBJC18700]
  5. National Science Foundation of China (NSFC)
  6. Program for Changjiang Scholars and Innovative Research Team in University (PCSIRT)
  7. China Postdoctoral Science Foundation
  8. Austrian Science Fund (FWF) [P26142] Funding Source: Austrian Science Fund (FWF)

Ask authors/readers for more resources

Shannon 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 Bollobas and Erdos, which is also called the Randi weight. As a result, we derived statements on dendrimers that have been proven useful for applications. Finally, some open problems are presented.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available