Szeged-like entropies of graphs

Abstract

<p>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.</p>