Maximum values of degree-based entropies of bipartite graphs

Yanni Dong; Shengning Qiao; Bing Chen; Pengfei Wan; Shenggui Zhang

doi:10.1016/j.amc.2021.126094

Maximum values of degree-based entropies of bipartite graphs

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

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

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.

Original language	English
Article number	126094
Journal	Applied Mathematics and Computation
Volume	401
DOIs	https://doi.org/10.1016/j.amc.2021.126094
State	Published - 15 Jul 2021

Keywords

Bipartite graph
Degree
Graph entropy

Access to Document

10.1016/j.amc.2021.126094

Cite this

@article{02aff72094504339b563a30d664d8f15,

title = "Maximum values of degree-based entropies of bipartite graphs",

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 = "Bipartite graph, Degree, Graph entropy",

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

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier Inc.",

year = "2021",

month = jul,

day = "15",

doi = "10.1016/j.amc.2021.126094",

language = "英语",

volume = "401",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Maximum values of degree-based entropies of bipartite graphs

AU - Dong, Yanni

AU - Qiao, Shengning

AU - Chen, Bing

AU - Wan, Pengfei

AU - Zhang, Shenggui

PY - 2021/7/15

Y1 - 2021/7/15

N2 - 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.

AB - 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.

KW - Bipartite graph

KW - Degree

KW - Graph entropy

UR - http://www.scopus.com/inward/record.url?scp=85102015327&partnerID=8YFLogxK

U2 - 10.1016/j.amc.2021.126094

DO - 10.1016/j.amc.2021.126094

M3 - 文章

AN - SCOPUS:85102015327

SN - 0096-3003

VL - 401

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

M1 - 126094

ER -

Maximum values of degree-based entropies of bipartite graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this