Resolution of Yan's Conjecture on Entropy of Graphs

IF 2.9 2区化学 Q2 CHEMISTRY, MULTIDISCIPLINARY

Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2022-05-06 DOI:10.46793/match.89-2.389c

Stijn Cambie, Matteo Mazzamurro

引用次数: 2

Abstract

The ﬁrst degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. In this paper, we characterize the connected graphs with given order n and size m that minimize the ﬁrst degree-based entropy whenever n − 1 ≤ m ≤ 2 n − 3 , thus extending and proving a conjecture by Yan.

查看原文本刊更多论文

关于图的熵的Yan猜想的解决

图的第一个基于度的熵是其度序列经度和归一化后的香农熵。本文刻画了n−1≤m≤2n−3时一阶熵最小的给定阶数和大小为m的连通图，从而推广并证明了Yan的一个猜想。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Match-Communications in Mathematical and in Computer Chemistry 化学-化学综合

CiteScore

4.40

自引率

26.90%

发文量

审稿时长

2 months

期刊介绍： MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.