<?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=23365"><dc:title>Minimum entropy of graphs with given size</dc:title><dc:creator>Cambie,	Stijn	(Avtor)
	</dc:creator><dc:creator>Mazzamurro,	Matteo	(Avtor)
	</dc:creator><dc:subject>graph entropy</dc:subject><dc:description>The first degree-based graph entropy of a graph is the Shannon entropy of its degree sequence. Its correct interpretation as a measure of uniformity of the degree sequence requires the determination of its extremal values given natural constraints. In this paper,we prove that the graphs with given size that minimize the first degree-based graph entropy are precisely the colex graphs.</dc:description><dc:publisher>University of Primorska</dc:publisher><dc:date>2025</dc:date><dc:date>2026-07-27 11:11:14</dc:date><dc:type>Neznano</dc:type><dc:identifier>23365</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
