{"?xml":{"@version":"1.0"},"edm:RDF":{"@xmlns:dc":"http://purl.org/dc/elements/1.1/","@xmlns:edm":"http://www.europeana.eu/schemas/edm/","@xmlns:wgs84_pos":"http://www.w3.org/2003/01/geo/wgs84_pos","@xmlns:foaf":"http://xmlns.com/foaf/0.1/","@xmlns:rdaGr2":"http://rdvocab.info/ElementsGr2","@xmlns:oai":"http://www.openarchives.org/OAI/2.0/","@xmlns:owl":"http://www.w3.org/2002/07/owl#","@xmlns:rdf":"http://www.w3.org/1999/02/22-rdf-syntax-ns#","@xmlns:ore":"http://www.openarchives.org/ore/terms/","@xmlns:skos":"http://www.w3.org/2004/02/skos/core#","@xmlns:dcterms":"http://purl.org/dc/terms/","edm:WebResource":[{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-8PSMQ32P/b2c1ff40-b519-4c92-8291-67af826af6b9/PDF","dcterms:extent":"253 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-8PSMQ32P/c3801cf4-787c-48d9-bdbd-8af5efc86eb4/TEXT","dcterms:extent":"22 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-8PSMQ32P/1bd2d32d-bf2b-4cc0-affc-8e5421304590/PDF","dcterms:extent":"95 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-8PSMQ32P/b436f5e5-6793-42d6-8da7-67ba68411cf6/TEXT","dcterms:extent":"3 KB"}],"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-8PSMQ32P","dcterms:issued":"2025","dc:creator":["Cambie, Stijn","Mazzamurro, Matteo"],"dc:format":[{"@xml:lang":"sl","#text":"letnik:1"},{"@xml:lang":"sl","#text":"številka:1, article   p1.03"},{"@xml:lang":"sl","#text":"str. 1-10"}],"dc:identifier":["DOI:10.26493/2820-6657.3.bfd","ISSN:2820-6657","COBISSID_HOST:285420035","URN:URN:NBN:SI:doc-8PSMQ32P"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"University of Primorska"},"dc:source":{"@xml:lang":"sl","#text":"Discrete mathematical chemistry"},"dc:subject":[{"@xml:lang":"sl","#text":"entropija grafov"},{"@xml:lang":"en","#text":"graph entropy"}],"dc:title":{"@xml:lang":"sl","#text":"Minimum entropy of graphs with given size|"},"dc:description":[{"@xml:lang":"sl","#text":"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"},{"@xml:lang":"sl","#text":"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"}],"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:doc-8PSMQ32P","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-8PSMQ32P"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-8PSMQ32P/b2c1ff40-b519-4c92-8291-67af826af6b9/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by-sa/4.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Univerza na Primorskem"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-8PSMQ32P/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-8PSMQ32P"}}}}