<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=22290"><dc:title>On the main distance-based entropies: the eccentricity- and Wiener-entropy</dc:title><dc:creator>Cambie,	Stijn	(Avtor)
	</dc:creator><dc:creator>Dong,	Yanni	(Avtor)
	</dc:creator><dc:subject>eccentricity-entropy</dc:subject><dc:subject>Wiener-entropy</dc:subject><dc:description>We define the Wiener-entropy, which is together with the eccentricity-entropy one of the most natural distance-based graph entropies. By deriving the (asymptotic) extremal behaviour, we conclude that the Wiener-entropy of graphs of a given order is more spread than is the case for the eccentricity-entropy. We solve 3 conjectures on the eccentricity-entropy and give a conjecture on the Wiener-entropy related to some surprising behaviour on the graph minimizing it.</dc:description><dc:publisher>Založba Univerze na Primorskem</dc:publisher><dc:date>2026</dc:date><dc:date>2025-12-21 23:01:11</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>22290</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
