Minimum entropy of graphs with given size

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Minimum entropy of graphs with given size
Authors:	ID Cambie, Stijn (Author) ID Mazzamurro, Matteo (Author)
Files:	ZUP_Cambie_Stijn_2025.pdf (253,92 KB) MD5: CE6DDA5A1C6ECA3AD9E76D797D808174 https://dmc-journal.eu/index.php/dmc/article/view/3/6
Language:	English
Work type:	Unknown
Organization:	ZUP - University of Primorska Press
Abstract:	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.
Keywords:	graph entropy
Publication status:	Published
Publication version:	Version of Record
Place of publishing:	Koper
Publisher:	University of Primorska
Year of publishing:	2025
Number of pages:	str. 1-10
Numbering:	Vol. 1, no. 1, [article no. ] P1.03
PID:	20.500.12556/RUP-23365
UDC:	519.17
ISSN on article:	2820-6657
DOI:	10.26493/2820-6657.3.bfd
COBISS.SI-ID:	285420035
Publication date in RUP:	27.07.2026
Views:	19
Downloads:	0
Metadata:
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Title:	Discrete mathematical chemistry
Publisher:	University of Primorska
ISSN:	2820-6657
COBISS.SI-ID:	109303555

Funder:	UK Research and InnovationFuture Leaders Fellowship

Funder:	EPSRC Center for Doctoral Training in Urban Science and Progress
Funding programme:	(EP/L016400/1) and EPSRC DTP (EP/N509796/1)

License:	CC BY 4.0, Creative Commons Attribution 4.0 International

Link:	http://creativecommons.org/licenses/by/4.0/
Description:	This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Language:	Slovenian
Title:	Minimalna entropija grafov dane velikosti
Abstract:	Prva entropija grafa, osnovana na stopnjah vozlišč, je Shannonova entropija zaporedja stopenj vozlišč. Njena pravilna interpretacija kot merilo uniformnosti zaporedja stopenj vozlišč zahteva določitev njenih ekstremalnih vrednosti ob upoštevanju naravnih omejitev. V tem članku dokažemo, da so grafi dane velikosti, ki imajo minimalno prvo entropijo, osnovano na stopnjah vozlišč, natanko koleks (koleksikografski) grafi.
Keywords:	entropija grafov

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back