Szeged-like entropies of graphs

Matthias Dehmer, Frank Emmert-Streib, Niko Tratnik and Petra Žigert Pleteršek

Applied Mathematics and Computation, 2022, vol. 431, issue C

Abstract: In this paper, we define some new distance-based graph measures and explore various properties. In particular, we develop a novel family of Szeged-like entropies and investigate several features thereof. We deduce a cut method for computing these entropies from quotient graphs, apply the obtained result to a molecular graph, and underpin the usefulness of the novel measures by numerical results.

Keywords: Szeged entropy; Mostar entropy; PI entropy; Cut method; Quotient graphs; Sensitivity of a topological descriptor (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032200399X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:431:y:2022:i:c:s009630032200399x

DOI: 10.1016/j.amc.2022.127325

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().