<?xml version="1.0"?><rdf: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-STAYWRQ0/2ad8cf3c-88d2-4da3-9599-0442ae92935e/PDF"><dcterms:extent>1133 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-STAYWRQ0/862c142b-d678-49cb-a2c7-b37adfc4f814/TEXT"><dcterms:extent>87 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-STAYWRQ0/e2102674-d687-427f-9115-cccea4256ef6/PDF"><dcterms:extent>139 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-STAYWRQ0/90ffd63b-9721-4dae-b477-392dc7a80a74/TEXT"><dcterms:extent>5 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="2008-2026"><edm:begin xml:lang="en">2008</edm:begin><edm:end xml:lang="en">2026</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-STAYWRQ0"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR" /><dcterms:issued>2026</dcterms:issued><dc:creator>Fowler, Patrick W.</dc:creator><dc:creator>MacGillivray, Gary</dc:creator><dc:creator>Myrvold, Wendy</dc:creator><dc:creator>Slobodin, Aaron</dc:creator><dc:format xml:lang="sl">številka:1, article  p1.07</dc:format><dc:format xml:lang="sl">letnik:26</dc:format><dc:format xml:lang="sl">str. 1-38</dc:format><dc:identifier>DOI:10.26493/1855-3974.3282.6ea</dc:identifier><dc:identifier>ISSN:1855-3974</dc:identifier><dc:identifier>COBISSID_HOST:288372739</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-STAYWRQ0</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Univerza na Primorskem</dc:publisher><dcterms:isPartOf xml:lang="sl">Ars mathematica contemporanea</dcterms:isPartOf><dc:subject xml:lang="en">anionic Clar number</dc:subject><dc:subject xml:lang="sl">anionsko Clarjevo število</dc:subject><dc:subject xml:lang="en">chemical graph theory</dc:subject><dc:subject xml:lang="sl">fulereni</dc:subject><dc:subject xml:lang="en">fullerenes</dc:subject><dc:subject xml:lang="sl">kemijska teorija grafov</dc:subject><dcterms:temporal rdf:resource="2008-2026" /><dc:title xml:lang="sl">Tight upper bounds for the p-anionic Clar number of fullerenes|</dc:title><dc:description xml:lang="sl">A fullerene is an all-carbon molecule with a polyhedral structure where each atom is bonded to three other atoms and each face is either a pentagon or a hexagon. Fullerenes correspond to 3-regular planar graphs whose faces have sizes 5 or 6. The p-anionic Clar number C_(p)(G) of a fullerene G is equal to p + h, where h is maximized over all choices of p + h independent faces (exactly p pentagons and h hexagons) the deletion of whose vertices leave a graph with a perfect matching. This definition is motivated by the chemical observation that pentagonal rings can accommodate an extra electron, so that the pentagons of a fullerene with charge -p, compete with the hexagons to host ‘Clar sextets’ of six electrons, and pentagons will preferentially acquire the p excess electrons of the anion. Tight upper bounds are established for the p-anionic Clar number of fullerenes for p &gt; 0. The upper bounds are derived via graph theoretic arguments and new results on minimal cyclic-k-edge cutsets in IPR fullerenes (fullerenes that have all pentagons pairwise disjoint). These bounds are shown to be tight by infinite families of fullerenes that achieve them</dc:description><dc:description xml:lang="sl">Fuleren je molekula, sestavljena iz ogljikovih atomov s poliedrsko strukturo, kjer je vsak atom vezan na tri druge atome, vsaka ploskev pa je bodisi petkotnik bodisi šestkotnik. Fulereni ustrezajo 3-regularnim ravninskim grafom, katerih ploskve imajo velikost 5 ali 6. p-anionsko Clarjevo število Cp(G) fulerena G je enako p + h, kjer je h maksimalno glede na vse izbire p + h neodvisnih ploskev (natančno p petkotnikov in h šestkotnikov), katerih odstranjevanje vozlišč pusti graf s popolnim prirejanjem. Ta definicija izhaja iz kemijskega opažanja, da lahko petkotni obroči sprejmejo dodaten elektron, tako da se petkotniki fulerena z nabojem -p tekmujejo s šestkotniki za gostovanje »Clarjevih sekstetov« šestih elektronov, pri čemer petkotniki prednostno pridobijo p presežnih elektronov aniona. Vzpostavljene so stroge zgornje meje za p-anionsko Clarjevo število fulerenov za p &gt; 0. Zgornje meje so izpeljane z grafovnimi argumenti in novimi rezultati o minimalnih cikličnih k-robnih rezih v IPR fulerenih (fulereni, ki imajo vse petkotnike paroma disjunktne). Te meje se izkažejo za ostre z neskončnimi družinami fulerenov, ki jih dosežejo</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-STAYWRQ0"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-STAYWRQ0" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-STAYWRQ0/2ad8cf3c-88d2-4da3-9599-0442ae92935e/PDF" /><edm:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-STAYWRQ0/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-STAYWRQ0" /></ore:Aggregation></rdf:RDF>