Maximum values of degree-based entropies of bipartite graphs

作者：

Highlights：

• Determine the maximum value of the degree-based entropy among bipartite graphs with a given number of vertices and edges.

• Characterize all the extremal graphs by the corresponding degree sequences.

• The main result implies the known result due to Cao et al. (2014) that the degree-based entropy of the path attains the maximum value among all trees with a given number of vertices.

摘要

•Determine the maximum value of the degree-based entropy among bipartite graphs with a given number of vertices and edges.•Characterize all the extremal graphs by the corresponding degree sequences.•The main result implies the known result due to Cao et al. (2014) that the degree-based entropy of the path attains the maximum value among all trees with a given number of vertices.

论文关键词：Graph entropy,Bipartite graph,Degree

论文评审过程：Received 27 October 2020, Revised 28 January 2021, Accepted 4 February 2021, Available online 5 March 2021, Version of Record 5 March 2021.

论文官网地址：https://doi.org/10.1016/j.amc.2021.126094