Szeged-like entropies of graphs

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. (c) 2022 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ )