IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v261y2015icp141-147.html
   My bibliography  Save this article

Degree-based entropies of networks revisited

Author

Listed:
  • Cao, Shujuan
  • Dehmer, Matthias

Abstract

Studies on the information content of graphs and networks have been initiated in the late fifties based on the seminal work due to Shannon and Rashevsky. Various graph parameters have been used for the construction of entropy-based measures to characterize the structure of complex networks. Based on Shannon’s entropy, in Cao et al. (Extremality of degree-based graph entropies, Inform. Sci. 278 (2014) 22–33), we studied graph entropies which are based on vertex degrees by using so-called information functionals. As a matter of fact, there has been very little work to find their extremal values when considered Shannon entropy-based graph measures. We pursue with this line of research by proving further extremal properties of the degree-based graph entropies.

Suggested Citation

  • Cao, Shujuan & Dehmer, Matthias, 2015. "Degree-based entropies of networks revisited," Applied Mathematics and Computation, Elsevier, vol. 261(C), pages 141-147.
  • Handle: RePEc:eee:apmaco:v:261:y:2015:i:c:p:141-147
    DOI: 10.1016/j.amc.2015.03.046
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315003604
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2015.03.046?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cao, Shujuan & Dehmer, Matthias & Kang, Zhe, 2017. "Network Entropies Based on Independent Sets and Matchings," Applied Mathematics and Computation, Elsevier, vol. 307(C), pages 265-270.
    2. Wen, Tao & Jiang, Wen, 2018. "An information dimension of weighted complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 501(C), pages 388-399.
    3. Ni, Chengzhang & Yang, Jun & Kong, Demei, 2020. "Sequential seeding strategy for social influence diffusion with improved entropy-based centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    4. Dingyi Gan & Bin Yang & Yongchuan Tang, 2020. "An Extended Base Belief Function in Dempster–Shafer Evidence Theory and Its Application in Conflict Data Fusion," Mathematics, MDPI, vol. 8(12), pages 1-19, December.
    5. Ghorbani, Modjtaba & Dehmer, Matthias & Rajabi-Parsa, Mina & Emmert-Streib, Frank & Mowshowitz, Abbe, 2019. "Hosoya entropy of fullerene graphs," Applied Mathematics and Computation, Elsevier, vol. 352(C), pages 88-98.
    6. Knor, Martin & Škrekovski, Riste & Tepeh, Aleksandra, 2016. "Digraphs with large maximum Wiener index," Applied Mathematics and Computation, Elsevier, vol. 284(C), pages 260-267.
    7. Ma, Yuede & Cao, Shujuan & Shi, Yongtang & Dehmer, Matthias & Xia, Chengyi, 2019. "Nordhaus–Gaddum type results for graph irregularities," Applied Mathematics and Computation, Elsevier, vol. 343(C), pages 268-272.
    8. Chen, Zengqiang & Dehmer, Matthias & Shi, Yongtang, 2015. "Bounds for degree-based network entropies," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 983-993.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:261:y:2015:i:c:p:141-147. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.