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

Maximum values of degree-based entropies of bipartite graphs

Author

Listed:
  • Dong, Yanni
  • Qiao, Shengning
  • Chen, Bing
  • Wan, Pengfei
  • Zhang, Shenggui

Abstract

The degree-based entropy of a graph is defined as the Shannon entropy based on the information functional that associates the vertices of the graph with the corresponding degrees. We obtain the maximum value of the degree-based entropy among bipartite graphs with n vertices and and m edges by characterizing corresponding degree sequences. This implies the known result due to Cao et al. (2014) that the path attains the maximum degree-based entropy among trees with n vertices.

Suggested Citation

  • Dong, Yanni & Qiao, Shengning & Chen, Bing & Wan, Pengfei & Zhang, Shenggui, 2021. "Maximum values of degree-based entropies of bipartite graphs," Applied Mathematics and Computation, Elsevier, vol. 401(C).
    • Handle: RePEc:eee:apmaco:v:401:y:2021:i:c:s0096300321001429
    DOI: 10.1016/j.amc.2021.126094
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321001429
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126094?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.

    References listed on IDEAS

    as
    1. Wan, Pengfei & Tu, Jianhua & Dehmer, Matthias & Zhang, Shenggui & Emmert-Streib, Frank, 2019. "Graph entropy based on the number of spanning forests of c-cyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Dong, Yanni & Broersma, Hajo & Song, Changwu & Wan, Pengfei & Zhang, Shenggui, 2023. "The effect of graph operations on the degree-based entropy," Applied Mathematics and Computation, Elsevier, vol. 437(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:401:y:2021:i:c:s0096300321001429. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.