A note on distance-based graph entropies

From MaRDI portal
Publication:2416993

DOI10.3390/e16105416zbMath1412.94134OpenAlexW2081422980MaRDI QIDQ2416993

Yongtang Shi, Matthias Dehmer, Zeng-Qiang Chen

Publication date: 27 May 2019

Published in: Entropy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/e16105416




Related Items (23)

New inequalities for network distance measures by using graph spectraEntropy Measures of Distance MatrixComputational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctionsInertia of complex unit gain graphsBounds for degree-based network entropiesOn graph entropy measures based on the number of independent sets and matchingsOn topological properties of degree-based entropy of hex-derived network of type 3On measuring the complexity of networks: Kolmogorov complexity versus entropyOn extremal cacti with respect to the first degree-based entropyTopological indices and graph entropies for carbon nanotube Y-junctionsComplex Dynamics in a Triopoly Game with Multiple Delays in the Competition of Green Product LevelAn improved data fusion method based on weighted belief entropy considering the negation of basic probability assignmentNetwork entropies based on independent sets and matchingsExtremal values of matching energies of one class of graphsHermitian Laplacian matrix and positive of mixed graphsOn the distance based graph entropiesSome bounds of weighted entropies with augmented Zagreb index edge weightsOn the extremal values of general degree-based graph entropiesGraph entropy based on the number of spanning forests of \(c\)-cyclic graphsA comparative analysis of new graph distance measures and graph edit distanceFirst degree-based entropy of graphsAnalyzing lattice networks through substructuresThe effect of graph operations on the degree-based entropy




This page was built for publication: A note on distance-based graph entropies