Abstrakti
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.
Alkuperäiskieli | Englanti |
---|---|
Artikkeli | 127325 |
Julkaisu | Applied Mathematics and Computation |
Vuosikerta | 431 |
DOI - pysyväislinkit | |
Tila | Julkaistu - 15 lokak. 2022 |
OKM-julkaisutyyppi | A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä |
Julkaisufoorumi-taso
- Jufo-taso 1
!!ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics