Abstract
Shannon entropies for networks have been widely introduced. Several graph invariants have been used for defining graph entropy measures. Using majorization theory, we obtain some lower and upper bounds on graph entropy measures. Moreover we prove more extremal properties for entropies of graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 259-272 |
| Number of pages | 14 |
| Journal | Match |
| Volume | 78 |
| Issue number | 2 |
| State | Published - 2017 |
Fingerprint
Dive into the research topics of 'Some properties on entropies of graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver