Maximum values of degree-based entropies of bipartite graphs

Yanni Dong, Shengning Qiao, Bing Chen, Pengfei Wan and Shenggui Zhang

Applied Mathematics and Computation, 2021, vol. 401, issue C

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.

Keywords: Graph entropy; Bipartite graph; Degree (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321001429
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:401:y:2021:i:c:s0096300321001429

DOI: 10.1016/j.amc.2021.126094

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().