Szeged-like entropies of graphs

作者：

Highlights：

• We develop a novel family of Szeged-like entropies of graphs.

• The cut method for Szeged-like entropies is deduced and applied to a molecular graph.

• Discrimination power and the value-domain coverage of defined measures is investigated.

摘要

•We develop a novel family of Szeged-like entropies of graphs.•The cut method for Szeged-like entropies is deduced and applied to a molecular graph.•Discrimination power and the value-domain coverage of defined measures is investigated.

论文关键词：Szeged entropy,Mostar entropy,PI entropy,Cut method,Quotient graphs,Sensitivity of a topological descriptor

论文评审过程：Received 6 January 2022, Revised 9 June 2022, Accepted 11 June 2022, Available online 4 July 2022, Version of Record 4 July 2022.

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