摘要
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.
| 源语言 | 英语 |
|---|---|
| 期刊论文编号 | 126094 |
| 期刊 | Applied Mathematics and Computation |
| 卷 | 401 |
| DOI | |
| 出版状态 | 已出版 - 15 7月 2021 |
学术指纹
探究 'Maximum values of degree-based entropies of bipartite graphs' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver