Szeged-like entropies of graphs

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

doi:10.1016/j.amc.2022.127325

Szeged-like entropies of graphs

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

^*Corresponding author for this work

Private University for Health Sciences, Medical Informatics and Technology
Swiss Distance University of Applied Sciences
Nankai University
Xi'an Technological University
Tampere University
University of Maribor
Institute of Mathematics, Physics and Mechanics Ljubljana

Research output: Contribution to journal › Article › peer-review

9 Citations (Scopus)

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. (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/ )

Original language	English
Article number	127325
Journal	Applied Mathematics and Computation
Volume	431
DOIs	https://doi.org/10.1016/j.amc.2022.127325
Publication status	Published - 15 Oct 2022
Externally published	Yes

Keywords

Cut method
Mostar entropy
PI entropy
Quotient graphs
Sensitivity of a topological descriptor
Szeged entropy

Access to Document

10.1016/j.amc.2022.127325

Cite this

@article{886f875636d94f83a16d94afeca715f8,

title = "Szeged-like entropies of graphs",

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. (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/ )",

keywords = "Cut method, Mostar entropy, PI entropy, Quotient graphs, Sensitivity of a topological descriptor, Szeged entropy",

author = "Matthias Dehmer and Frank Emmert-Streib and Niko Tratnik and \{{\v Z}igert Pleter{\v s}ek\}, Petra",

note = "Publisher Copyright: {\textcopyright} 2022 The Author(s)",

year = "2022",

month = oct,

day = "15",

doi = "10.1016/j.amc.2022.127325",

language = "English",

volume = "431",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Szeged-like entropies of graphs

AU - Dehmer, Matthias

AU - Emmert-Streib, Frank

AU - Tratnik, Niko

AU - Žigert Pleteršek, Petra

PY - 2022/10/15

Y1 - 2022/10/15

N2 - 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/ )

AB - 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/ )

KW - Cut method

KW - Mostar entropy

KW - PI entropy

KW - Quotient graphs

KW - Sensitivity of a topological descriptor

KW - Szeged entropy

UR - https://www.scopus.com/pages/publications/85133266836

U2 - 10.1016/j.amc.2022.127325

DO - 10.1016/j.amc.2022.127325

M3 - Article

AN - SCOPUS:85133266836

SN - 0096-3003

VL - 431

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

M1 - 127325

ER -

Szeged-like entropies of graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this